Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Emil Post

Modern

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
Birth Year
1897 1
Death Year
1954 1
Biography
Gender
Male 1
Connections

In Branch

Source Emil Leon Post (Wikipedia)

Proofs Credited

Source Post's theorem, Wikipedia
In the Other Atlases
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 Source
Post's theorem, Wikipedia
Proofs Credited: Post's Theorem, Lead paragraph
Quote, 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.
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.