Recursion Theory Revisited - Zhupa, Eustrat
56,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 1-2 Wochen
payback
28 °P sammeln
  • Broschiertes Buch

Most classic results in logic and recursivity use number theoretic algorithms. Coding non-trivial algorithm by means of additions and multiplications may become ridiculously cumbrous. Understanding logic and recursion may be significantly improved by rewriting the algorithms implied by their constructive proofs in languages "playing" with a data-type more sophisticated than mere "int" or "string". In the book readers will find definition and use for a new model of TM, called "list TM", which is based on the data-type their name suggests.

Andere Kunden interessierten sich auch für
Produktbeschreibung
Most classic results in logic and recursivity use number theoretic algorithms. Coding non-trivial algorithm by means of additions and multiplications may become ridiculously cumbrous. Understanding logic and recursion may be significantly improved by rewriting the algorithms implied by their constructive proofs in languages "playing" with a data-type more sophisticated than mere "int" or "string". In the book readers will find definition and use for a new model of TM, called "list TM", which is based on the data-type their name suggests.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Autorenporträt
Eustrat Zhupa obtained his PhD in Computer Science from University of Bari, Italy. He has several years of experience in teaching Theory of Computation, Algorithms, Programming Languages, System Programming. Currently, he is a member of the Research Institute of Science and Technology and a professor at the University of Ohrid in Macedonia.