RESOURCES
-
Diagramming tool which makes creating DFAs easy
gliffy
-
Alan Turing,
CodeBreaker,
The Imitation Game
-
Hilbert's Problems scroll down in the page to see how
the results turned out.
-
In
The Church-Turing Thesis Jack Copeland argues that the Church-Turing Thesis
does not actually define computatbility. Copland claims that the typical
interpretation of the Church-Turing Thesis "tends to obscure the possibility
that there may be machines, or biological organs, that calculate
(or compute, in a broad sense) functions that are not Turing-machine-computable."
-
Godel's incompleteness theorems
-
Chomsky Language Hierarchy via Wikipedia
-
Turing Test via Wikipedia
-
In
"Would Turing Have Passed the Turing Test?" ACM Communications, Vol. 9, 2014, Moshe Y. Vardi argues
that the Turing test is not a very good measurement of intelligence. Vardi states
"Turing decided to avoid philosophical controversy and define intelligence operationally –
a machine is considered to be intelligent if it can act intelligently." Robert M. French,
"Moving Beyond the Turing Test" also argues this point.
-
Guildelines in writing proofs
-
Fun book to read, winner of the Pulitzer Prize, full of mathematical puzzels,
it relates
Godel, Escher, Bach: An Eternal Golden Braid
-
Turing machine simulator
simulator
-
Discrete Structures
topic review and
reference sheet