Links to Alan Turing

• Alan Turing in the Encyclopaedia Britannica.
• The Alan Turing Home Page.

Links to Turing Machine Simulators

• The Java Computability Toolkit. The Java Computability Toolkit (JCT) contains a pair of graphical environments for creating and simulating NFAs, DFAs, and high level Turing Machines.
• Look also at this really cool Turing Machine Simulation developed by the Buena Vista University Java Team! (This applet was written for Sun's Java Cup International contest by the Java Team at Buena Vista University. It won first place in the Education category.)
• Turing's World: A book on Turing machines that comes with a program that allows one to design and debug Turing machines.
• Turing Machine simulation in Java.

There are other web sites with information on (downloadable) Turing machine simulators.
These are maintained by:

• David Matz
• David Woodruff

Look also here for a nice Turing Machine simulator written in Java (and documented in German). (Many thanks to Thomas Rask Thomsen for providing this one!)

Some people whose work has had a great impact on the field of Computability Theory:

• Charles Babbage
• Alonzo Church
• Robin Gandy
• Kurt Gödel
• Reuben Goodstein
• Stephen Kleene
• Emil Post

Other links that you might want to explore are:

• A seemingly interesting introductory link to logic, and its uses in Computer Science and Mathematics. It has a useful glossary, where you can find explanations of some of the terminology we use in the course. As an example, see here for the notions of effective procedure, decidable, and semi-decidable problems.
• Pioneers of Computing, a page where you can find information on the people that have shaped our science. You may also wish to have a look at the Virtual Computer History Museum. (Thanks to Christian E. Kaas for pointing out that my previous link to these pages was no longer in existence.)
• Bibliographic Database for Computability Theory.
• Stephen Cole Kleene in the Encyclopaedia Britannica.
• Goedel's Incompleteness Theorems in the Encyclopaedia Britannica.
• NP-completeness in the Encyclopaedia Britannica.

Some people whose work has had a great impact on the field of Computability Theory:

• Charles Babbage
• Alonzo Church
• Robin Gandy
• Kurt Gödel
• Reuben Goodstein
• Stephen Kleene
• Emil Post

Other links that you might want to explore are:

• A seemingly interesting introductory link to logic, and its uses in Computer Science and Mathematics. It has a useful glossary, where you can find explanations of some of the terminology we use in the course. As an example, see here for the notions of effective procedure, decidable, and semi-decidable problems.
• Pioneers of Computing, a page where you can find information on the people that have shaped our science. You may also wish to have a look at the Virtual Computer History Museum. (Thanks to Christian E. Kaas for pointing out that my previous link to these pages was no longer in existence.)
• Bibliographic Database for Computability Theory.
• Stephen Cole Kleene in the Encyclopaedia Britannica.
• Goedel's Incompleteness Theorems in the Encyclopaedia Britannica.
• NP-completeness in the Encyclopaedia Britannica.

Recently there has been a great interest in alternative models of computation. Prominent amongst these are quantum computing and DNA computing. Some information on these exciting models of computation may be obtained from the following links:

• Frequently Asked Questions about Quantum Computation.
• Introductions and Tutorials on Quantum Computation.
• Scientific American "Ask the Experts" on DNA-based computing.
• Publications on DNA based Computers.