January 01, 1936
Alan Turing proved there is no general-purpose mechanical way to tell whether a program is going to find an answer (The Halting Problem).
| Name | Type | Mentions | |
|---|---|---|---|
| Alan Turing | person | 134 | View Entity |
HOUSE_OVERSIGHT_015933.jpg
This document appears to be page 243 of a book or manuscript discussing theoretical computer science and mathematics. It details the history of the 'Halting Problem' (originally termed 'not crashing' or 'Being circle free' by Alan Turing) and references Hilbert's 10th Problem. The page bears a 'HOUSE_OVERSIGHT_015933' stamp, indicating it was produced as evidence in a US House Oversight investigation, presumably related to Jeffrey Epstein's connections to the scientific community.
Events with shared participants
Turing's discovery of a solution to the Decision Problem (Entscheidungsproblem).
1935-01-01 • Historical context
Publication of 'Computing Machinery and Intelligence' by Alan Turing.
1950-01-01 • British journal Mind
Publication of Alan Turing's paper 'Computing Machinery and Intelligence' in the journal Mind.
1950-01-01 • United Kingdom (implied by British journal)
Turing contemplating the decidability of mathematics and envisioning the Turing machine.
1935-01-01 • Cambridge/Grantchester
Turing made a Fellow of King's College, Cambridge.
1935-01-01 • Cambridge
Outbreak of war made Turing's work practically important for code breaking.
Date unknown
Alan Turing presented a paper describing the modern computer.
1936-01-01 • London Mathematical Society
Alan Turing wrote, revised, and published 'On Computable Numbers...'.
1936-01-01 • N/A
Alan Turing submitted a paper effectively inventing the modern computer.
Date unknown • London Mathematical Society
Publication of 'On Computable Numbers and their Application to the Entscheidungsproblem'
1936-01-01 • Cambridge
Discussion 0
No comments yet
Be the first to share your thoughts on this epstein event