Is It Turing Complete?

From Gnomon Chronicles
Revision as of 06:33, 1 June 2016 by Admin (talk | contribs) (Created page with "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-formu...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
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 (nonfiction) compete in various Turing-completeness challenges.

Fiction cross-reference

Nonfiction cross-reference

Retrieved from "https://gnomonchronicles.com/w/index.php?title=Is_It_Turing_Complete%3F&oldid=4851"