Articoli correlati a Turing completeness: Turing Reduction, Computability...
Turing completeness: Turing Reduction, Computability Theory, Abstract Machine, Programming Language, Computable Function, Universal Turing Machine, Church–Turing Thesis, Cellular Automaton - Brossura
Sinossi
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.)
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Turing completeness: Turing Reduction, Computability...
Immagini fornite dal venditore
Turing completeness
Editore:
VDM Verlag Dr. Müller E.K. Feb 2010, 2010
ISBN 10: 6130353499
ISBN 13: 9786130353490
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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.) Englisch. Codice articolo 9786130353490
Compra nuovo
EUR 45,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Turing completeness : Turing Reduction, Computability Theory, Abstract Machine, Programming Language, Computable Function, Universal Turing Machine, Church-Turing Thesis, Cellular Automaton
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.). Codice articolo 9786130353490
Compra nuovo
EUR 249,68
Spedizione EUR 35,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili