Items related to Wolfram's 2-State 3-Symbol Turing Machine: Stephen...

Wolfram's 2-State 3-Symbol Turing Machine: Stephen Wolfram, Turing Machine, Universal Turing Machine, Vaughan Pratt, Linear Bounded Automaton, Turing ... Turing Completeness, Rule 110, Tag System - Softcover

 
9786130362423: Wolfram's 2-State 3-Symbol Turing Machine: Stephen Wolfram, Turing Machine, Universal Turing Machine, Vaughan Pratt, Linear Bounded Automaton, Turing ... Turing Completeness, Rule 110, Tag System

This specific ISBN edition is currently not available.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In his A New Kind of Science, Stephen Wolfram found a universal 2-state 5-color Turing machine, and conjectured that a particular 2-state 3-color Turing machine (hereinafter (2,3) Turing machine) might be universal as well. On May 14, 2007, Wolfram announced a $25,000 prize to be won by the first person to prove or disprove the universality of the (2,3) Turing machine. According to Wolfram, the purpose of the prize was to encourage research to help answer foundational questions associated with the structure of what he calls the computational universe". On 24 October 2007, it was announced that the prize had been won by Alex Smith, a student in electronics and computing at the University of Birmingham."

"About this title" may belong to another edition of this title.

(No Available Copies)

Search Books:



Create a Want

Can'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