Mathematics as Information Compression via the Matching and Unification of Patterns

Table 4

An example of a transition function in a universal Turing machine, represented as a look-up table, as described in the text (based on the example in [57, Section 2], with permission).

Input (1)	Input (2)	Output (1)	Output (2)
	1		»
	0		1
	1		«
	0		»

Key: “»” means “move the read/write head one place to the right”; “«” means “move the read/write head one place to the left.”