New York: U.S.A.Elsevier Science Pub. Co. (1989)
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes and classical aspects of these areas, the subject matter has been selected to give priority throughout to the new aspects of traditional questions, results and methods which have developed from the needs or knowledge of computer science and particularly of complexity theory. It is both a textbook for introductory courses in the above-mentioned disciplines as well as a monograph in which further results of new research are systematically presented and where an attempt is made to make explicit the connections and analogies between a variety of concepts and constructions.
|Keywords||Computable functions Computational complexity Logic, Symbolic and mathematical|
|Categories||categorize this paper)|
|Buy the book||$160.00 new (16% off) $256.24 used Amazon page|
|Call number||QA9.59.B6713 1989|
References found in this work BETA
No references found.
Citations of this work BETA
Beyond the Universal Turing Machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.
Beyond the Universal Turing Machine.B. Jack Copeland & Richard Sylvan - 1999 - Australasian Journal of Philosophy 77 (1):46-66.
Some Hierarchies of Primitive Recursive Functions on Term Algebras.Klaus‐Hilmar Sprenger - 1997 - Mathematical Logic Quarterly 43 (2):251-286.
Abstract State Machines: A Unifying View of Models of Computation and of System Design Frameworks.Egon Börger - 2005 - Annals of Pure and Applied Logic 133 (1-3):149-171.
Similar books and articles
Computability, Enumerability, Unsolvability: Directions in Recursion Theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - Cambridge University Press.
Bounded Arithmetic, Propositional Logic, and Complexity Theory.Jan Krajíček - 1995 - Cambridge University Press.
A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity.Shawn Hedman - 2004 - Oxford University Press.
Tailoring Recursion for Complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2007 - Cambridge University Press.
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Added to index2009-01-28
Total downloads19 ( #259,934 of 2,172,036 )
Recent downloads (6 months)1 ( #325,337 of 2,172,036 )
How can I increase my downloads?