Theory of Computation

Author:   George Tourlakis (York Univ., Toronto, Canada York University, Toronto York University, Toronto York University, Toronto York University, Toronto)
Publisher:   John Wiley & Sons
ISBN:  

9786613622297


Pages:   410
Publication Date:   23 April 2012
Format:   Electronic book text
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $364.32 Quantity:  
Add to Cart

Share |

Theory of Computation


Add your own review!

Overview

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.

Full Product Details

Author:   George Tourlakis (York Univ., Toronto, Canada York University, Toronto York University, Toronto York University, Toronto York University, Toronto)
Publisher:   John Wiley & Sons
Imprint:   John Wiley & Sons
ISBN:  

9786613622297


ISBN 10:   661362229
Pages:   410
Publication Date:   23 April 2012
Audience:   General/trade ,  General
Format:   Electronic book text
Publisher's Status:   Active
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Table of Contents

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List