Alan Mathison Turing

Record year1952

M rationaleThe reaction-diffusion model provides an analyzable mechanism by which spatial patterns arise from a uniform state, becoming a reusable interdisciplinary theoretical tool; no additional score is given for particular biological phenomena, experimental confirmation, or the entire later body of pattern-formation theory.

attribution rationaleTuring constructed the theory of reaction-diffusion instability; the specified biological and chemical inputs of Waddington, Michaelis-Menten, Jeans, and others are retained, and experimental support or later applications are not converted into an individual share.

Record year1936

M rationaleRepresenting finite symbolic processes in machine form and constructing universal simulation provides a reusable computational method; the limiting argument verifies that method and is not counted again as a shared undecidability conclusion.

attribution rationaleChurch's attribution share in this achievement is 4.00%. Turing's machine construction accounts for 68%; Church's lambda-method relational input 4%; logical predecessors 9%, Max Newman 6%, human computation and symbolic-operation practice 4%, scholarly-publication support 4%, and unallocated 5%. The attribution proportions are revisable research judgments.

overlap boundaryIt is separately counted with Church's lambda-conversion method as independent method delivery; the joint decision conclusion and the equivalence relation between the two forms are not listed again as a third full contribution.

Evidence gapsExisting sources and a limited set of principal families are retained for the assessment; evidence of continued use, independent alternative paths, and predecessor contributions is not exhaustive. This revision did not reread the full texts of all original works.

Record year1939

M rationaleOrdinal progressions and oracle machines turn the provability limits of formal systems into an extensible framework, creating an important capacity in foundational logic; the whole subsequent body of recursion theory is not included.

attribution rationaleChurch's attribution share in this achievement is 10.0000%. Turing supplied the core construction of ordinal logics and the oracle framework; the computability and recursion-theory inputs of Church and Kleene are explicitly retained.

Evidence gapsExisting sources and a limited set of principal families are retained for the assessment; evidence of continued use, independent alternative paths, and predecessor contributions is not exhaustive. This revision did not reread the full texts of all original works.

Record year1946

M rationaleA specific stored-program machine design organized computation, storage, and control as realizable architectural capabilities; it does not include actual construction, other machine paths, or the modern computing industry.

attribution rationaleTuring completed ACE's architectural design; von Neumann's pre-existing stored-program work and unallocated engineering inputs are retained and not erased by report authorship.

Record year1950

M rationaleRecasting 'Can machines think?' as a discussable imitation game and systematically responding to a set of objections created a durable public and professional methodological issue; it is not an empirical determination of machine intelligence or the entire subsequent capability of artificial intelligence.

attribution rationaleTuring completed the reframing of the question and the argumentative structure; the contexts of existing computers, philosophy of mind, and objections are retained with limits, and public discussion itself is not mistaken for an exclusive technical achievement.

Record year1948

M rationaleIt publicly treats shared numerical errors in linear equations, inversion, triangular decomposition, and reordered elimination, covering a class of core computational tasks and thus exceeding a local technique; but it lacks evidence of independent dissemination, and its error assumptions and failure cases keep it below the international-method tier.

attribution rationaleTuring analyzed rounding errors under specific conditions and provided conditional LDU conclusions; Gauss/Cholesky elimination, the Hotelling-von Neumann-Goldstine context, and practice by Fox and others remain specific prerequisites.

Record year1949

M rationaleIt states the problem of program correctness as a teachable method of assertions and termination checks, creating specialized but portable programming knowledge; it does not include all program verification or modern formal methods.

attribution rationaleTuring published specific checking steps and arguments; logic and programming contexts and conference-publication support are retained, without absorbing the entire verification tradition under a single person's authorship.

Record year1953

M rationaleCounting zeros and checking the completeness of computed zeros provide specialized analytic-number-theory capacity; the Riemann hypothesis, complete zero distribution, and later large-scale computation are not included.

attribution rationaleTuring proposed the counting and completeness-check method; Littlewood, Riemann-Titchmarsh, and existing zero calculations remain specific prerequisites.

Record year1937–1938

M rationaleThe finite-approximation conclusion within connected Lie groups is a reusable specialized group-theory method; the original proposition cannot unconditionally extend to disconnected groups, so no broader disciplinary-foundation claim is made.

attribution rationaleTuring completed the proof subject to the connectedness condition; Jordan's and von Neumann's predecessor tools and publication support are retained, and finite-group counterexamples are not ignored.

Record year1948

M rationaleIt proposes a specific technical model for trainable, organizable machines, exceeding pure speculation; but construction, deployment, and stable performance are unproven, so it remains only a limited specialized proposal.

attribution rationaleTuring supplied the model and training conception of unorganised machines; unallocated technical implementation and historical inputs remain retained, and later machine-learning systems cannot be included.

Record year1938

M rationaleExtension criteria and constructions under explicit conditions provide a set of operational methods for specialized group theory; they are not equivalent to a general group-theory platform or later classification theory.

attribution rationaleTuring proposed these extension conditions and constructions; the prior methods of Baer, Schreier, and Reidemeister each remain retained, and a single-paper authorship cannot be inflated into exclusivity.

Record year1935

M rationaleA finite, verifiable equivalence proof provides specialized mathematical knowledge, but shows neither a cross-domain platform nor broad application and is therefore limited to the scale of a specialist method.

attribution rationaleTuring proved the equivalence of two definitions of almost periodicity; Bohr's almost-periodic theory remains a prerequisite, and the definitional tradition is not rewritten as Turing's sole invention.

Record year1942–1943

M rationalePublic institutional materials confirm that this was a statistical-analysis method for the Lorenz/Fish problem and that subsequent machine concepts made use of it, so it went beyond a private idea. Evidence concerning its operation, users, outputs, and final intelligence results remains incomplete; it therefore cannot be raised to a higher level of achievement in actual use.

attribution rationaleTuring proposed Turingery's statistical-analysis method; Tutte's research prehistory, intercept-test personnel, Post Office engineering, institutional resources, and unallocated inputs are retained, while Newmanry and Colossus are not counted as Turing's personal delivery.

Record year1956

M rationaleTwo independent simulation constructions jointly deliver the model invariance of state/symbol tradeoffs; they more directly alter the general description of computational models than a local sharp bound does, but do not claim credit for the computer industry.

attribution rationaleShannon's delivery of two classes of simulation constructions for state/symbol tradeoffs is assigned 0.72; Turing's universal-machine object is an irreplaceable specific predecessor input at 0.20, and the remaining 0.08 is unallocated.

overlap boundaryCount only the simulation constructions under state/symbol constraints; Turing's original universal-machine result, subsequent minimal machines, and the computer industry are not counted again.

Evidence gapsExisting sources and a limited set of principal families are retained for the assessment; evidence of continued use, independent alternative paths, and predecessor contributions is not exhaustive. This revision did not reread the full texts of all original works.

Record year1943–1945

M rationaleThis method improves numerical evaluation of zeta in a specified range and has reusable specialized value; it does not include the Riemann hypothesis, complete zero calculation, or later algorithmic systems.

attribution rationaleTuring gave steps for function evaluation in the intermediate range; the functional equation, integrals, and existing computational methods are retained as inputs and are not converted into personal discoveries.

Record year1944–1945

M rationaleThere was a jointly developed and restored working prototype with successful demonstration, crossing beyond the pure-proposal stage; key units still required improvement, and there was no deployment or cross-unit adoption, so it is limited to shared prototype capability.

attribution rationaleTuring and Donald Bayley jointly completed and demonstrated the Delilah prototype; Bell Labs' SIGSALY concept, Hanslope resources, and other unknown inputs remain retained, and it cannot be treated as led by one person or expanded into a deployed system.

Record year1940–1945

M rationaleA bounded workflow already integrated into practical cryptanalysis created reusable security capability, but the current scope does not quantify intelligence results, the war's overall effects, or the full value of hardware systems.

attribution rationaleTuring participated in Banburismus and Bombe-related analytical work; attribution also retains Welchman, engineering and manufacture, Polish–French prior work, interception and verification staff, and institutional resources. It is neither divided equally by number of authors nor extended to Colossus.

Record yearLate 1940s–1966

summaryStudied how abstract automata can construct and reproduce themselves; Burks organized and completed unfinished portions.

M rationaleIn the same band as ACE M5: both are bounded, generally applicable computational constructions that were not fully physically realized; modern artificial life and biotechnology are not borrowed to raise it into the mature-system band.

attribution rationaleJohn's conception/posthumous papers 60%, Burks's technical completion 20%, Ulam's simplified-model input 10%, Turing's methodological predecessor 5%, unknown 5%; all are rough estimates.

overlap boundaryOnly the formal scheme for general construction and description copying, together with Burks's technical completion of the unfinished design, is included; probabilistic reliable logic N11A, stored-program N09A, actual self-reproducing hardware, energy closure, and every later cellular automaton are excluded.

Evidence gapsThe details of Chapter Five of the original book have not been checked page by page; Ulam's model input is cited from a research monograph's quotation of original materials; Chapter Five has not been checked page by page; part of Ulam's input comes from the monograph's quotation.

Record year1956

M rationaleM4.3: general and lasting distinction between random input and noncomputable information in computational capability, with independent theorem-level reuse; broader than a narrow counting technique, below a whole computing foundation or universal machine theory. 4.0 and 4.6 represent narrower-theorem versus wider conceptual-method readings.

attribution rationaleChurch’s attribution share in this outcome is 1.00%. Turing’s universal machine and computability framework are identifiable specific premises in the paper; the joint proof work of De Leeuw, Moore, and Shapiro and other mathematical inputs are listed separately, and Turing cannot be listed as a paper author.

overlap boundaryOne 1956 joint knowledge family, Theorems 1–5 and their stated effective supplements: p-machine enumeration/ordered-sequence relation to deterministic input carrying p; computable p does not enlarge this class; noncomputable p can. c-s-machine computable transition/output functions reduce to fair-coin machines in the specified eventual-output sense.

Evidence gapsExisting sources and a limited set of principal families are retained for the assessment; evidence of continued use, independent alternative paths, and predecessor contributions is not exhaustive. This revision did not reread the full texts of all original works.