Tourlakis, George

Theory of Computation

Tourlakis, George - Theory of Computation, ebook

DRM Restrictions

Printing125 pages with an additional page accrued every 6 hours, capped at 125 pages
Copy to clipboard5 excerpts

In the (meta)theory of computing, the fundamental questions of the limitations of computing are addressed.   These limitations, which are intrinsic rather than technology dependent, may immediatly rule out the existence of algorithmic solutions for some problems while for others they rule out efficient solutions.  The author's approach is anchored on the concrete (and assumed) practical knowledge about general computer programming, attained readers in a first year programming course, as well as the knowledge of discrete mathematics at the same level.  The book develops the metatheory of general computing and builds on the reader's prior computing experience.  Metatheory via the programming formalism known as Shepherdson-Sturgis Unbounded Register Machines (URM)—a straightforward abstraction of modern highlevel programming languages—is developed.  Restrictions of the URM programming language are also discussed.  The author has chosen to focus on the highlevel language approach of URMs as opposed to the Turing Machine since URMs relate more directly to programming learned in prior experiences.  The author presents the topics of automata and languages only after readers become familiar, to some extent, with the (general) computability theory including the special computability theory of more “practical” functions, the primitive recursive functions.  Automata are presented as a very restricted programming formalism, and their limitations (in expressivity) and their associated languages are studied.  In addition, this book contains tools that, in principle, can search a set of algorithms to see whether a problem is solvable, or more specifically, if it can be solved by an algorithm whose computations are efficient.  Chapter coverage includes: Mathematical Background; Algorithms, Computable Functions, and Computations; A Subset of the URM Language: FA and NFA; and Adding a Stack to an NFA: Pushdown Automata.

Keywords: Discrete Mathematics, everyday computing, Unbounded Register Machines, finite automation, Loop Programs, Deterministic Finite Automata, Nondeterministic Finite Automata, Pushdown Automata, computational theory, computer science

John Wiley and Sons, Inc.
Publication year
Page amount
416 pages
Natural Sciences
Printed ISBN

Similar titles