English mathematician and computing pioneer Alan Mathison Turing published the computer theory, On Computable Numbers, with an application to the Entscheidungsproblem in 1937. Proving that a universal computing machine or Turing machine could solve any problem that involved numbers or other symbols.

Date:
      1937
Name(s):
      Alan Mathison Turing
Occupation:
      mathematician
Location:
      England

Additional Information:

• Computer Epistemology | World Scientific Series in Computer …
  A Treatise on the Feasibility of the Unfeasible or Old Ideas Brewed New … problems of epistemology (the theory of knowledge) related to computer science.
• Theoretical computer science – Wikipedia
  Theoretical computer science (TCS) is a subset of general computer science and mathematics …. An ancient precursor is the Sanskrit treatise Shulba Sutras, or “Rules of the Chord”, that is a book of algorithms written in 800 BCE. The book …
• History of Computer Science
  1928)). The 1960’s also saw the rise of automata theory and the theory of formal … 1938), author of 3-volume treatise entitled The Art of Computer Programming.
• Computer Epistemology: A Treatise on the Feasibility of the …
  Buy Computer Epistemology: A Treatise on the Feasibility of the Unfeasible or Old Ideas Brewed New (World Scientific Computer Science) on Amazon.com …
• 8 Theoretical Research: Intangible Cornerstone of Computer …
  Read chapter 8 Theoretical Research: Intangible Cornerstone of Computer … volume of a treatise on the subject that remains an indispensable reference today.