- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Computation and automata
New York: Cambridge University Press (1985)
Abstract
This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Logic and computation: interactive proof with Cambridge LCF.Lawrence C. Paulson - 1987 - New York: Cambridge University Press.
Computability, complexity, logic.Egon Börger - 1989 - New York, N.Y., U.S.A.: Elsevier Science Pub. Co..
Parallel architectures and mental computation.Andrew Wells - 1993 - British Journal for the Philosophy of Science 44 (3):531-542.
Models of computation and formal languages.Ralph Gregory Taylor - 1998 - New York: Oxford University Press.
Massively parallel distributed processing and a computationalist foundation for cognitive science.Albert E. Lyngzeidetson - 1990 - British Journal for the Philosophy of Science 41 (March):121-127.
Computability in Context: Computation and Logic in the Real World.S. B. Cooper & Andrea Sorbi (eds.) - 2011 - World Scientific.
Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Tailoring recursion for complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
Analytics
Added to PP
2009-01-28
Downloads
46 (#344,354)
6 months
4 (#778,909)
2009-01-28
Downloads
46 (#344,354)
6 months
4 (#778,909)
Historical graph of downloads
Citations of this work
Dynamic systems as tools for analysing human judgement.Joachim Funke - 2001 - Thinking and Reasoning 7 (1):69 – 89.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-pjbg5 uwo