Turing completeness: Turing Reduction, Computability Theory, Abstract Machine, Programming Language, Computable Function, Universal Turing Machine, Church-Turing Thesis, Cellular Automaton

Turing completeness: Turing Reduction, Computability Theory, Abstract Machine, Programming Language, Computable Function, Universal Turing Machine, Church-Turing Thesis, Cellular Automaton

Taschenbuch - 9786130353490
45,00 €
  • Versandkostenfrei
  • Hinweis: Print on Demand. Lieferbar innerhalb von 7 bis 10 Tagen
  • inkl. MwSt. & Versandkosten (innerhalb Deutschlands)
  • Hinweis: Print on Demand. Lieferbar innerhalb von 7 bis 10 Tagen
  • inkl. MwSt. & Versandkosten (innerhalb Deutschlands)

Autorenfreundlich Bücher kaufen?!

Beschreibung

High Quality Content by WIKIPEDIA articles! A computational system that can compute every Turing-computable function is called Turing-complete (or Turing-powerful). Alternatively, such a system is one that can simulate a universal Turing machine.A Turing-complete system is called Turing-equivalent if every function it can compute is also Turing-computable; i.e., it computes precisely the same class of functions as do Turing machines. Alternatively, a Turing-equivalent system is one that can simulate, and be simulated by, a universal Turing machine. (All known Turing-complete systems are Turing-equivalent, which adds support to the Church-Turing thesis.)

Details

Verlag Betascript Publishers
Ersterscheinung Februar 2010
Maße 220 mm x 150 mm x 8 mm
Gewicht 213 Gramm
Format Taschenbuch
ISBN-13 9786130353490
Auflage Nicht bekannt
Seiten 132

Schlagwörter