CDF demonstrations
Below are links to Mathematica-produced CDF demonstrations, as used in the MATH2907 lectures.
To get the best from these interactive modules, you will need to download
the free CDF player
from the Wolfram Inc. website.
If you have the Wolfram Player installed but the plug-in does not work, then download the CDF files for viewing locally, using the (CDF) links below.
MATH2907 Session 1, 2020: Languages and Machines
Lectures in Weeks 2–6: Finite State Machines (FSMs & FSAs)
Lectures in Weeks 7–9: Turing Machines
- Turing machine programs
- ZERO: computes the zero function on the 1st argument (CDF)
- INCrement: adds 1 to the 1st argument (CDF)
- FIND: locates a 1 to the right (CDF)
- REPEAT: duplicates a number (CDF)
- ADD: adds two numbers (CDF)
- ADD': alternative way to do addition (CDF)
- DOUBLE: doubles a number (CDF)
- HALVE: halves a number (CDF)
- QUARTER: quarters a number (CDF)
- QUARTER': quarters w/o halving (CDF)
- 2n: power of 2 (CDF)
- 2-way find: locates a 1 to left or right (CDF)
- 3-state TM: example (CDF)
- sum of TMs: example (CDF)
- Tutorial Turing machine examples
- Week 9: example (a) (CDF)
- Week 9: example (b) (CDF)
- Week 9: example (c) (CDF)
- Week 10: example 1 (CDF)
- Week 10: example 2 (CDF)
- Extended Turing machine examples
- multiple tracks: 2-track swap (CDF)
- 3-character: add 1 to binary number (CDF)
- 3-character: reverse binary string (CDF)
- multi-character: parenthesis language (CDF)
- Busy-Beaver examples
- Non-halting examples
- 2-state non-halting (CDF)
- 3-state non-halting 1 (CDF)
- 3-state non-halting 2 (CDF)
- 3-state non-halting 3 (CDF)
- 4-state non-halting 1 (CDF)