Emil Leon Post was an American mathematician and logician, born on 11 February 1897 and died on 21 April 1954. He is best known for his work in the field that eventually became known as computability theory, which asks which problems can be solved by an algorithm and how hard the unsolvable ones are. His research belongs to the founding period of that field in the 1930s and 1940s, alongside other logicians such as Kleene and Turing, and it helped establish the questions the subject still studies.
Facts
Connections
Attributed Works
Source Turing degree (Wikipedia)
In Branch
Source Emil Leon Post (Wikipedia)
Proofs Credited
Source Post's theorem, Wikipedia
In the Other Atlases
Same As
Also in Computing Atlas: the same subject.
Also in Science Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Emil Leon Post (Wikipedia)Lead paragraph [nationality-culture]Quote, Lead paragraph [nationality-culture]
was an American mathematician
Sources
1. Emil Leon Post (Wikipedia)
Lead paragraph
He is best known for his work in the field that eventually beca
Lead paragraph [nationality-culture]
was an American mathematician
In Branch: Computability Theory, Lead paragraph [in-branch]
computability theory
View the SourcePost's theorem, Wikipedia
Proofs Credited: Post's Theorem, Lead paragraphQuote, Proofs Credited: Post's Theorem, Lead paragraph
In computability theory, Post's theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees.
Turing degree (Wikipedia)
Attributed Works: Turing Degree, LeadQuote, Attributed Works: Turing Degree, Lead
The Turing degrees were introduced by Post (1944) and many fundamental results were established by Kleene & Post (1954).
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.