Items related to 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 - Softcover
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.)
"About this title" may belong to another edition of this title.
- PublisherBetascript Publishing
- Publication date2010
- ISBN 10 6130353499
- ISBN 13 9786130353490
- BindingTapa blanda
- LanguageEnglish
- Number of pages132
- EditorSurhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want