FACTOID # 176: Nauru is the world's smallest independent republic.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Emil Post

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 New York City, USA.


In 1936 he developed, independently of Alan Turing's Turing machine, an abstract computer model named the Post machine.


His Post correspondence problem contributed to the decision problems of recursion theory, as a new model of computation.


Essential reading

  • Davis, Martin (1964). The Undecidable (Ed.), pp. 228-433. Ravello: Raven Press. ISBN 0-91-121601-4

External links

  • Biography of Post (http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Post.html)

  Results from FactBites:
 
Emil Leon Post Information (277 words)
Emil Leon Post (February 11 1897 – April 21 1954) was an American mathematician and logician.
His Post correspondence problem contributed to the decision problems of recursion theory, as a new model of computation.
Emil Leon Post at the MacTutor History of Mathematics archive.
Post biography (1953 words)
Post's early death at the age of 57 was almost certainly a direct consequence of the treatment he received for his mental illness.
Post received the electric shock treatment on a number of occasions and it was while he was in a mental institution, shortly after receiving electric shocks, that he suffered a heart attack and died.
Post is best known for his work on polyadic groups, recursively enumerable sets, and degrees of unsolvability, as well as for his contribution to the unsolvability of problems in combinatorial mathematics.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.