|
Emil Leon Post (February 11, 1897 - April 21, 1954) was a Polish-American mathematician and logician. He was born in a Jewish family in Augustow, and died in New York City, USA. February 11 is the 42nd day of the year in the Gregorian Calendar. ...
1897 was a common year starting on Friday (see link for calendar). ...
April 21 is the 111th day of the year in the Gregorian calendar (112th in leap years). ...
1954 was a common year starting on Friday of the Gregorian calendar. ...
A mathematician is a person whose area of study and research is mathematics. ...
The article titled Logicians treats the ancient Chinese philosophers known by that name (with a capital L). List of logicians (with a lower-case l) treats philosophers, mathematicians, and others whose topic of scholarly study is logic. ...
The word Jew ( Hebrew: יהודי) is used in a wide number of ways, but generally refers to a follower of the Jewish faith, a child of a Jewish mother, or someone of Jewish descent with a connection to Jewish culture or ethnicity and often a combination of these attributes. ...
Motto: none Voivodship Podlasie Municipal government Urząd Miasta Augustów Mayor Leszek Cieslik Area 80,9 km² Population - city - urban - density 30 870 - 387/km² Founded City rights - - Latitude Longitude 53°51 N 22°58 E Area code +48 87 Car plates BAU Twin towns - Municipal Website Augustów (Lithuanian Augustavas) is...
New York City (officially named the City of New York) is the most populous city in the United States, the most densely populated major city in North America, and is at the center of international finance, politics, entertainment, and culture. ...
In his Columbia University doctoral thesis, he proved, among other things, that the propositional calculus of Principia Mathematica was complete: all tautologies are theorems, given the Principia axioms and a rule of uniform substitution. Van Heijenoort's (1966) source book on mathematical logic reprinted Post's classic article setting out this result. This thesis also devised truth tables independently of Wittgenstein and Charles Peirce and put them to good mathematical use. The Principia Mathematica is a three-volume work on the foundations of mathematics, written by Alfred North Whitehead and Bertrand Russell and published in 1910-1913. ...
Ludwig Wittgenstein (1889-1951), pictured here in 1930, made influential contributions to Logic and the philosophy of language, critically examining the task of conventional philosophy and its relation to the nature of language. ...
Charles Sanders Peirce Charles Sanders/Santiago Peirce (pronounced purse), September 10, 1839 – April 19, 1914, was an American logician, philosopher, scientist, and mathematician. ...
In 1936 he developed, independently of Alan Turing's Turing machine, an abstract computer model named the Post machine. 1936 was a leap year starting on Wednesday (link will take you to calendar). ...
Alan Turing is often considered the father of modern computer science. ...
The Turing Machine is an abstract machine introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm or mechanical procedure. The concept is still widely used in theoretical computer science, especially in complexity theory and the theory of computation. ...
In theoretical computer science and recursion theory, a Post machine, named after Emil Leon Post, is a deterministic finite automaton with a queue. ...
His Post correspondence problem contributed to the decision problems of recursion theory, as a new model of computation. The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946. ...
In logic, a decision problem is determining whether or not there exists a decision procedure or algorithm for a class S of questions requiring a Boolean value (i. ...
Computability theory is that part of the theory of computation dealing with which problems are solvable by algorithms (equivalently, by Turing machines), with various restrictions and extensions. ...
Important publications
In this article Post introduced the important concept of many-one reduction. The American Mathematical Society (AMS) is dedicated to the interests of mathematical research and education, which it does with various publications and conferences as well as annual monetary awards to mathematicians. ...
In computational complexity theory, a many-one reduction is a reduction which converts instances of a decision problem problem A into instances of a decision problem B. We write A ≤m B or A is many-one reducible to B. If we have an algorithm N which solves instances of...
Essential reading - Davis, Martin (1993). The Undecidable (Ed.), pp. 288-406. Dover. ISBN 0-486-43228-9. Reprints several papers by Post.
- Davis, Martin (1994). "Emil L. Post: His Life and Work" in Davis, M., ed., Solvability, Provability, Definability: The Collected Works of Emil L. Post. Birkhäuser: xi--xxviii. A biographical essay.
See Also In computability theory Posts Problem is a famous problem first stated by Emil Post in 1944. ...
In computability theory Posts theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. ...
In mathematical logic, the arithmetical hierarchy or arithmetic hierarchy classifies the set of arithmetic formulas (or arithmetic sets) according to their degree of solvability. ...
External links |
Feeds |
Contact