Is It Turing Complete?: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
[[File:Universal_Turing_machine.svg|thumb|A Universal Turing machine '''U'''. '''U''' consists of a set of instructions in the table that can “execute” the correctly-formulated “code number” of any arbitrary Turing machine '''M''' on its tape. In some models, the head shuttles back and forth between various regions on the tape. In other models the head shuttles the tape back and forth.]]'''Is It Turing Complete?''' is a [[reality TV]] show in which [[ | [[File:Universal_Turing_machine.svg|thumb|A Universal Turing machine '''U'''. '''U''' consists of a set of instructions in the table that can “execute” the correctly-formulated “code number” of any arbitrary Turing machine '''M''' on its tape. In some models, the head shuttles back and forth between various regions on the tape. In other models the head shuttles the tape back and forth.]]'''Is It Turing Complete?''' is a [[reality TV]] show in which [[Mathematician (nonfiction)|mathematicians]] compete in various [[Turing-completeness]] challenges. | ||
== Fiction cross-reference == | == Fiction cross-reference == | ||
Revision as of 10:03, 10 June 2016
A Universal Turing machine U. U consists of a set of instructions in the table that can “execute” the correctly-formulated “code number” of any arbitrary Turing machine M on its tape. In some models, the head shuttles back and forth between various regions on the tape. In other models the head shuttles the tape back and forth.
Is It Turing Complete? is a reality TV show in which mathematicians compete in various Turing-completeness challenges.