computability - Is there a total binary computable function that specifies Turing machines with nonempty domain? - Computer Science Stack Exchange
Computable Functions. - ppt download
Collection On Computable Numbers | MagCloud
The Origins of the Turing Machines
The Royal Societies of Australia - #Onthisday in 1936, pioneering scientist & mathematician Alan Turing submitted 'On Computable Numbers' for publication, in which he set out the theoretical basis for modern computers.
iGEM NOUS on X: "On November 12, 1937, Alan's Turing paper entitled "On Computable Numbers with an Application to the Entscheidungs - problem" wich was later renamed "Turing Machine". #OnThisDay #AlanTuring https://t.co/UFc3OJfZL1" /
On Computable Numbers , Turing, Alan - Amazon.com
Alan Turing on Computable Numbers and Computer Programs | Alan Richmond
Turing Computability: Theory and Applications (Theory and Applications of Computability): Soare, Robert I.: 9783642319327: Amazon.com: Books
Beyond Turing Computable Numbers to Computable Abstractions
Alan Turing, On computable numbers | Joel David Hamkins
The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine: Petzold, Charles: 9780470229057: Amazon.com: Books