Paper/Outline of a Mathematical Theory of Computation

From PKC
Revision as of 15:57, 24 February 2022 by Benkoo (talk | contribs)
Jump to navigation Jump to search

Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group. 


Currently your browser does not use a PDF plugin. You may however download the PDF file instead.

As one read this seminal paper/book, it should be noted that this idea is profoundly simple. To help better perceive this simplicity, Tai-Danae Bradley has a blog entry[1] The Most Obvious Secret in Mathematics on this matter. Further more, you can try to visit the page:What is a Thing?[2][3].

An important note

I manually transcribed the whole document into Google Doc. In theory, this can also be automatically converted to any other document format using Pandoc. An important point about this document is in its title. If we were to replace the term, Computation to Decision, this paper would have immediately mean a lot more to mere mortals without any loss of its correctness.

Related Pages

  1. ↑ Bradley, Tai-Danae. The Most Obvious Secret in Mathematics. local page: math3ma.com. Retrieved Feb 24, 2022.  Tai-Danae Bradley
  2. ↑ Döring, A.; Isham, C. (2010). "What is a Thing?". local page: 753–937. ISBN 978-3-642-12821-9. 
  3. ↑ Heidegger, Martin (1967). What is a Thing?. local page: Regenery/Gateway. 
Retrieved from "https://pkc.pub/index.php?title=Paper/Outline_of_a_Mathematical_Theory_of_Computation&oldid=26538"