Models of Computation and Formal Languages
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Oxford University Press (1998)
This unique book presents a comprehensive and rigorous treatment of the theory of computability which is introductory yet self-contained. It takes a novel approach by looking at the subject using computation models rather than a limitation orientation, and is the first book of its kind to include software. Accompanying software simulations of almost all computational models are available for use in conjunction with the text, and numerous examples are provided on disk in a user-friendly format. Its applications to computer science itself include interesting links to programming language theory, compiler design theory, and algorithm design. The software, numerous examples, and solutions make this book ideal for self-study by computer scientists and mathematicians alike.
|Keywords||Computable functions Formal languages|
|Categories||categorize this paper)|
|Buy the book||$0.99 used (100% off) $52.76 new (65% off) $110.00 direct from Amazon Amazon page|
|Call number||QA9.59.T39 1998|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Julia Uddén, Martin Ingvar, Peter Hagoort & Karl M. Petersson (2012). Implicit Acquisition of Grammars With Crossed and Nested Non-Adjacent Dependencies: Investigating the Push-Down Stack Model. Cognitive Science 36 (6):1078-1101.
Karl Magnus Petersson, Christian Forkstam & Martin Ingvar (2004). Artificial Syntactic Violations Activate Broca's Region. Cognitive Science 28 (3):383-407.
Similar books and articles
B. Jack Copeland (1996). What is Computation? Synthese 108 (3):335-59.
Lawrence C. Paulson (1987). Logic and Computation: Interactive Proof with Cambridge Lcf. Cambridge University Press.
E. Börger (1989). Computability, Complexity, Logic. New York, N.Y., U.S.A.Elsevier Science Pub. Co..
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
S. B. Cooper & Andrea Sorbi (eds.) (2011). Computability in Context: Computation and Logic in the Real World. World Scientific.
Peter Smith (2003). An Introduction to Formal Logic. Cambridge University Press.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Arto Salomaa (1985). Computation and Automata. Cambridge University Press.
Added to index2009-01-28
Total downloads3 ( #439,653 of 1,700,311 )
Recent downloads (6 months)2 ( #269,935 of 1,700,311 )
How can I increase my downloads?