000			03382nam a2200229Ia 4500
003			NULRC
005			20250520102819.0
008			250520s9999 xx 000 0 und d
020			_a9781118014783
040			_cNULRC
050			_aQA 9.59 .T68 2012
100			_aTourlakis, George J. _eauthor
245		0	_aTheory of computation / _cGeorge J. Tourlakis
260			_aHoboken, New Jersey : _bWiley, _cc2012
300			_axvii, 389 pages : _billustrations ; _c25 cm.
365			_bUSD32.19
504			_aIncludes bibliographical references and index.
505			_a1 Mathematical foundations -- 2. Algorithms, computable functions and computations -- 3. A subset of the URM language; FA and NFA -- 4. Adding a stack to a NFA: pushdown automata -- 5. Computational complexity.
520			_a"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"-- Provided by publisher."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 high-level programming languages--is developed. Restrictions of the URM programming language are also discussed. The author has chosen to focus on the high-level language approach of URMs as opposed to the Turing Machine since URMs relate more directly to programming learned in prior experiences"-- Provided by publisher.
650			_aCOMPUTABLE FUNCTIONS
942			_2lcc _cBK
999			_c15986 _d15986