• Corpus ID: 220867828

A Bibliography of Publications of Alan Mathison Turing

  title={A Bibliography of Publications of Alan Mathison Turing},
  author={Nelson H. F. Beebe},
This bibliography records publications of Alan Mathison Turing (1912{ 1954). Title word cross-reference [Tur37a]. K [Tur37c]. p [Tur37c]. -conversion [Tur37c]. -de nability [Tur37a]. -function [Tur37c]. 
1 Citations

Topics from this paper

A Bibliography of Publications of Nelson H. F. Beebe
This bibliography records publications of Nelson H. F. Beebe. Title word cross-reference #1 [68]. #2 [99, 184]. #3 [100, 186]. #4 [115, 192]. #5 [117, 195]. #6 [201]. #7 [210]. #8 [223]. 10 [49]. +


Improvements to Turing's method
  • T. Trudgian
  • Computer Science, Mathematics
    Math. Comput.
  • 2011
This paper refines the argument of Lehman by reducing the size of the constants in Turing's method by giving in Theorem 1 and scope for further improvements is also given.
Some Reflections on Alan Turing's Centenary
We review two of Alan Turing’s chief publications in mathematical logic: the classic 1936 paper On Computable Numbers [9] and the less well known paper Systems of Logic based on Ordinals [10]. Whilst
A celebration of Alan Turing's achievements in the year of his centenary
Some of the main achievements and contributions of Alan Turing to Computer Science and related areas are reviewed.
Turing and the test of time [Spectral Lines]
The centenary of Alan Turing's birth is being greeted by an extraordinary response, not only in mathematical and scientific circles but in a much wider public arena. It marks the awareness that he
Alan Turing and the Mathematical Objection
Alan Turing's ideas about machines, mathematical methods of proof, and intelligence, as well as other logicians' work, are concerned.
Turing in context.
In his Perspective “Beyond Turing's machines” (13 April, p. [163][1]), A. Hodges claims that in 1945 Turing “used his wartime technological knowledge to design a first digital computer.” He also
Turing's unpublished algorithm for normal numbers
In an unpublished manuscript, Alan Turing gave a computable construction to show that absolutely normal real numbers between 0 and 1 have Lebesgue measure 1; furthermore, he gave an algorithm for
Turing and the computer
Alan Turing: The Enigma is a posthumous publication based on a manuscript originally written by Alan Turing in 1982 and then edited by Andrew Hodges.
Turing Machines on Cayley Graphs
A generalization of standard Turing machines based on allowing unusual tapes and a set of reasonable constraints on tape geometry are presented and it is concluded that the proper degree of generality is Cayley graphs.
Turing's Connectionism
In a “little known” paper entitled “Intelligent Machinery,” Turing had already investigated connectionist models as early as 1948. Unfortunately, his work was dismissed by his employer and went