Here are some interesting links to sources on Theory of
Computation:
Link to the course textbook website : http://www-db.stanford.edu/~ullman/ialc.html. This website has the latest errata, solutions to hard problems and additional lecture notes.
The Clay Mathematics Institute.
Primes is in P : Professor Manindra Agrawal and two of his students solve the primality testing problem (i.e. Given a number, test if it is a prime or not ?) in polynomial time. The page also has a link to the PDF paper.
Great Prizes !!!
http://www.turing.org.uk/turing/ (Alan Turing home page)
http://www.abelard.org/turpap2/tp2-ie.asp (Turing's paper online)
http://www.cs.usfca.edu/www.AlanTuring.net/turing_archive/index.html The Turing Archive for the History of Computing
The Subway as a Turing Machine ..
http://www.cs.auckland.ac.nz/CDMTCS/chaitin/cmu.html (An article by G. J. Chaitin)
http://pass.maths.org.uk/issue5/turing/index.html (An article on What computers can't do ?)
http://www.research.att.com/~dsj/nsflist.html Challenges for Theoretical Computer Science
http://www.ltn.lv/~podnieks/gt.html
(Around Goedel's Theorem)
Writing Proofs:
http://www.math.unl.edu/~webnotes/classes/classAppA/classAppA.htm
(Information on
countable and uncountable sets)
http://www.netaxs.com/people/nerp/automata/syllabus.html ( A Course on theory of computation )
Kurt Gödel
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Godel.html
David Hilbert
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Hilbert.html
Alonzo Church
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Church.html
Alan Mathison Turing
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Turing.html
Stephen Cole Kleene
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Kleene.html
IEEE
computer Society: http://www.computer.org
ACM: http://www.acm.org
CS
Resource: You will find many good links to archives and online material here.
http://williamstallings.com/StudentSupport.html
TCS
formulas: This is a rather HUGE ‘cheat’ sheet for some handy formulae
http://bit.csc.lsu.edu/~seiden/cheat.pdf
This is a
site which describe matching of RE’s using Finite Automata