Alan Turing
2 references under this name, matched as it is written. Somebody else may write under it too, and the same person may appear here spelled another way.
This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.
Alan Turing
Computability and the earliest statement of program verification: 'On Computable Numbers, with an Application to the Entscheidungsproblem', and 'Checking a Large Routine' (1949), the paper usually credited as the first argument that a program can be proved to do what it should. The records arrived under two spellings, now joined.
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
Alan Turing (1938) · Proceedings of the London Mathematical Society · Wiley
On Computable Numbers, with an Application to the Entscheidungsproblem
Alan Turing (1937) · Proceedings of the London Mathematical Society · Wiley