000 05838cam a2200853 a 4500
001 ocn774024206
003 OCoLC
005 20171115105520.0
006 m o d
007 cr |||||||||||
008 120125s2012 nju ob 001 0 eng
010 _a 2012003569
020 _a9781118315354
_q(epub)
020 _a1118315359
_q(epub)
020 _a9781118315330
_q(pdf)
020 _a1118315332
_q(pdf)
020 _a9781118315347
_q(emobi)
020 _a1118315340
_q(emobi)
020 _a9781118315361
020 _a1118315367
020 _a128059246X
020 _a9781280592461
020 _z9781118014783
_q(hardback)
020 _z1118014782
_q(hardback)
024 8 _a9786613622297
028 0 1 _aEB00595499
_bRecorded Books
029 1 _aAU@
_b000048528601
029 1 _aAU@
_b000052005881
029 1 _aCHNEW
_b000602249
029 1 _aDEBBG
_bBV041431014
029 1 _aDEBSZ
_b37273913X
029 1 _aDEBSZ
_b397224400
029 1 _aDEBSZ
_b398268347
029 1 _aDEBSZ
_b422916323
029 1 _aDKDLA
_b820120-katalog:000599638
029 1 _aNZ1
_b14554645
035 _a(OCoLC)774024206
_z(OCoLC)795914179
_z(OCoLC)802330607
_z(OCoLC)817082387
_z(OCoLC)852165539
_z(OCoLC)852166392
_z(OCoLC)904962547
_z(OCoLC)927507831
_z(OCoLC)961501436
_z(OCoLC)962591608
_z(OCoLC)966499270
037 _a10.1002/9781118315361
_bWiley InterScience
_nhttp://www3.interscience.wiley.com
040 _aDLC
_beng
_epn
_cDLC
_dEBLCP
_dMERUC
_dYDXCP
_dN$T
_dCUS
_dDG1
_dE7B
_dCDX
_dIUL
_dDEBSZ
_dIDEBK
_dCOO
_dUMI
_dOCLCF
_dRECBK
_dOCLCQ
_dAZK
_dDG1
042 _apcc
049 _aMAIN
050 0 0 _aQA9.59
072 7 _aCOM
_x037000
_2bisacsh
082 0 0 _a511.3/52
_223
084 _aMAT008000
_2bisacsh
100 1 _aTourlakis, George J.
245 1 0 _aTheory of computation /
_cGeorge Tourlakis.
_h[electronic resource]
260 _aHoboken, N.J. :
_bWiley,
_c2012.
300 _a1 online resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _adata file
_2rda
380 _aBibliography
504 _aIncludes bibliographical references and index.
505 0 _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 -- 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"--
_cProvided by publisher.
520 _a"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"--
_cProvided by publisher.
588 0 _aPrint version record and CIP data provided by publisher.
650 0 _aComputable functions.
650 0 _aFunctional programming languages.
650 4 _aComputable functions.
650 4 _aFunctional programming languages.
650 7 _aMATHEMATICS
_xDiscrete Mathematics.
_2bisacsh
650 7 _aComputable functions.
_2fast
_0(OCoLC)fst00871985
650 7 _aFunctional programming languages.
_2fast
_0(OCoLC)fst00936087
650 7 _aComputable functions.
_2local
650 7 _aFunctional programming languages.
_2local
655 4 _aElectronic books.
655 7 _aElectronic books.
_2local
776 0 8 _iPrint version:
_aTourlakis, George J.
_tTheory of computation.
_dHoboken, N.J. : Wiley, 2012
_z9781118014783
_w(DLC) 2011051088
856 4 0 _uhttp://onlinelibrary.wiley.com/book/10.1002/9781118315361
_zWiley Online Library
942 _2ddc
_cBK
999 _c205532
_d205532