(Enter summary)
Abstract: This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and computation has bean added. The second relevant direction of research is the theory of computability as a branch of recursive function theory. The results of the basic work in this theory, including the existence of universal machines and the existence of unsolvable problems, have established a... (Update)
Cited by: More
A propositional logic with 4 values: - True False Divergent
(Correct)
Adaptive Functional Programming - Umut Acar Guy (2001)
(Correct)
Adaptive Memoization - Umut Acar Guy
(Correct)
Active bibliography (related documents): More All
0.3: Metrics for Action-labelled Quantitative Transition Systems - Deng, Chothia.. (2005)
(Correct)
0.3: Functional Programming and Embedded Systems - Wallace (1995)
(Correct)
0.3: Reflection in Oberon - Steindl (1997)
(Correct)
Similar documents based on text: More All
0.0: An Interaction Model Designed For Hand Gesture Input - Baudel, Beaudouin-Lafon
(Correct)
0.0: Voyager 2 Observations of Helium Abundance Enhancements from .. - Wang And Richardson (2001)
(Correct)
0.0: Literature Notes on Homeworks and the Takehome Exam - Of (2000)
(Correct)
Related documents from co-citation: More All
20: Incremental computation via function caching (context) - Pugh, Teitelbaum - 1989
15: Communicating Sequential Processes (context) - Hoare - 1985
12: A Computational Logic (context) - Boyer, Moore - 1979
BibTeX entry: (Update)
J. McCarthy. A basis for a mathematical theory of computation. In P. Braffort and D. Hirshberg, editors, Computer Programming and Formal Systems, pages 33--70. North-Holland, 1963. http://citeseer.ist.psu.edu/mccarthy63basis.html More
@inproceedings{ mccarthy63basis,
author = "John McCarthy",
title = "{A Basis for a Mathematical Theory of Computation}",
booktitle = "Computer Programming and Formal Systems",
publisher = "North-Holland, Amsterdam",
editor = "P. Braffort and D. Hirschberg",
pages = "33--70",
year = "1963",
url = "citeseer.ist.psu.edu/mccarthy63basis.html" }
Citations (may not include all citations):
185
The Calculi of Lambda-Conversion (context) - CHURCH - 1941
95
On Computable Numbers with an Application to the Entscheidun.. (context) - TURING - 1937
31
Computability and Unsolvability (context) - DAVIS - 1958
14
Transactions of the American Mathematical Society (context) - KLEENE - 1953
13
Report on the Algorithmic Language ALGOL (context) - NAUR - 1960
4
Princeton University Press (context) - Introduction, Logic - 1952
3
Doklady Akademii Nauk (context) - ERSHOV
3
Communications Of the ACM (context) - Recursive, Symbolic et al. - 1960
1
USSR Academy of Sciences (context) - MARKOV - 1954
1
Communications of the Association for Computing Machinery (context) - MCCARTHY - 1959
1
translated from the Russian by Nadler (context) - YANOV, The - 1960
1
Computation Center (context) - The, Manual - 1960
1
to be published in the Proceedings of the American Mathemati.. (context) - Computer, Checking - 1961
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.chalmers.se/~hallgren/Thesis/bibliography.html): More
Lecture Notes - Augusti Programming
(Correct)
BriX - A Deterministic Concurrent Functional X Windows System - Serrarens (1995)
(Correct)
Structuring Graphical Paradigms in TkGofer - Claessen, Vullinghs, Meijer (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC