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

 
9786130353490: Turing completeness: Turing Reduction, Computability Theory, Abstract Machine, Programming Language, Computable Function, Universal Turing Machine, Church-Turing Thesis, Cellular Automaton
Softcover
ISBN 10: 6130353499 ISBN 13: 9786130353490
Verlag: Betascript Publishers, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.)

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.)

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Betascript Publishers
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6130353499
ISBN 13 
9786130353490
Einband
Tapa blanda
Anzahl der Seiten
132
Herausgeber
Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar