Turing completeness: Turing Reduction, Computability Theory, Abstract Machine, Programming Language, Computable Function, Universal Turing Machine, Church–Turing Thesis, Cellular Automaton - Couverture souple
Synopsis
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.)
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.