15 Facts About Emil Post

Emil Leon Post was an American mathematician and logician.

Emil Post is best known for his work in the field that eventually became known as computability theory.

Emil Post was born in Augustow, Suwalki Governorate, Congress Poland, Russian Empire into a Polish-Jewish family that immigrated to New York City in May 1904.

Emil Post had been interested in astronomy, but at the age of twelve lost his left arm in a car accident.

Emil Post then became a high school mathematics teacher in New York City.

Related searches

Emil Post married Gertrude Singer in 1929, with whom he had a daughter, Phyllis Emil Post Goodman .

Emil Post spent at most three hours a day on research on the advice of his doctor in order to avoid manic attacks, which he had been experiencing since his year at Princeton.

Emil Post died in 1954 of a heart attack following electroshock treatment for depression; he was 57.

Emil Post initially failed to publish his ideas as he believed he needed a 'complete analysis' for them to be accepted.

In 1936, Emil Post developed, independently of Alan Turing, a mathematical model of computation that was essentially equivalent to the Turing machine model.

Emil Post's rewrite technique is ubiquitous in programming language specification and design, and so with Church's lambda-calculus is a salient influence of classical modern logic on practical computing.

Emil Post devised a method of 'auxiliary symbols' by which he could canonically represent any Emil Post-generative language, and indeed any computable function or set at all.

Emil Post showed that the Post Correspondence Problem of satisfying their constraints is, in general, undecidable.

Emil Post made a fundamental and still-influential contribution to the theory of polyadic, or n-ary, groups in a long paper published in 1940.

Emil Post demonstrated that a polyadic group operation on a set can be expressed in terms of a group operation on the same set.