03953nam a22005655i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001700172072001500189072001600204072002300220072002300243082001700266100003400283245012300317250001100440264004600451300004600497336002600543337002600569338003600595347002400631490001700655505055800672520153201230650002202762650001502784650001602799650002402815650003502839650002202874650002702896650003002923650004702953650004003000650003703040650004503077710003403122773002003156776003603176830001703212856004803229912001403277999001903291952007703310978-0-387-09639-1DE-He21320180115171345.0cr nn 008mamaa100301s2010 xxu| s |||| 0|eng d a97803870963919978-0-387-09639-17 a10.1007/978-0-387-09639-12doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.01512231 aRosenberg, Arnold L.eauthor.14aThe Pillars of Computation Theoryh[electronic resource] :bState, Encoding, Nondeterminism /cby Arnold L. Rosenberg. aFirst. 1aNew York, NY :bSpringer New York,c2010. aXVIII, 326 p. 49 illus.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aUniversitext0 aPROLEGOMENA -- Mathematical Preliminaries -- STATE -- Online Automata: Exemplars of #x201C;State#x201D; -- Finite Automata and Regular Languages -- Applications of the Myhill#x2013;Nerode Theorem -- Enrichment Topics -- ENCODING -- Countability and Uncountability: The Precursors of #x201C;Encoding#x201D; -- Enrichment Topic: #x201C;Efficient#x201D; Pairing Functions, with Applications -- Computability Theory -- NONDETERMINISM -- Nondeterministic Online Automata -- Nondeterministic FAs -- Nondeterminism in Computability Theory -- Complexity Theory. aComputation theory is a discipline that strives to use mathematical tools and concepts in order to expose the nature of the activity that we call “computation” and to explain a broad range of observed computational phenomena. Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? Even more basically: how does one reason about such questions? This book strives to endow upper-level undergraduate students and lower-level graduate students with the conceptual and manipulative tools necessary to make Computation theory part of their professional lives. The author tries to achieve this goal via three stratagems that set this book apart from most other texts on the subject. (1) The author develops the necessary mathematical concepts and tools from their simplest instances, so that the student has the opportunity to gain operational control over the necessary mathematics. (2) He organizes the development of the theory around the three “pillars” that give the book its name, so that the student sees computational topics that have the same intellectual origins developed in physical proximity to one another. (3) He strives to illustrate the “big ideas” that computation theory is built upon with applications of these ideas within “practical” domains that the students have seen elsewhere in their courses, in mathematics, in computer science, and in computer engineering. 0aComputer science. 0aComputers. 0aAlgorithms. 0aMathematical logic. 0aComputer sciencexMathematics.14aComputer Science.24aTheory of Computation.24aMathematics of Computing.24aAlgorithm Analysis and Problem Complexity.24aMathematical Logic and Foundations.24aComputation by Abstract Devices.24aMathematical Logic and Formal Languages.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9780387096384 0aUniversitext40uhttp://dx.doi.org/10.1007/978-0-387-09639-1 aZDB-2-SMA c369248d369248 001040708EBookaelibbelibd2018-01-15r2018-01-15w2018-01-15yEBOOK