000			04568nam a22003855i 4500
001			394892
003			ES-MaUEC
005			20230102123206.0
007			cr nn 008mamaa
008			220809s2022 sz | s |||| 0|eng d
020			_a9783031100550
024	7		_a10.1007/978-3-031-10055-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC
100	1		_aRosenberg, Arnold L _eautor _0(orcid)0000-0002-1171-9323 _1https://orcid.org/0000-0002-1171-9323 _4aut _4http://id.loc.gov/vocabulary/relators/aut
245	1	0	_aUnderstanding Computation _bPillars, Paradigms, Principles _cby Arnold L Rosenberg, Lenwood S Heath
250			_a1st edition 2022
264		1	_aCham _bSpringer International Publishing _c2022
300			_a1 recurso en línea (XVII, 570 páginas) _b87 illus
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aTexts in Computer Science _x1868-095X
505	0		_aPreface -- I: Introduction -- 1 Introducing Computation Theory -- 2 Introducing the Book -- II: Pillar S: STATE -- 3 Pure State-Based Computational Models -- 4 The Myhill-Nerode Theorem: Implications and Applications -- 5 Online Turing Machines and the Implications of Online Computing -- 6 Pumping: Computational Pigeonholes in Finitary Systems -- 7 Mobility in Computing: An FA Navigates a Mesh -- 8 The Power of Cooperation: Teams of MFAs on a Mesh -- III: Pillar E: ENCODING -- 9 Countability and Uncountability: The Precursors of ENCODING -- 10 Computability Theory -- 11 A Church-Turing Zoo of Computational Models -- 12 Pairing Functions as Encoding Mechanisms -- IV: Pillar N: NONDETERMINISM -- 13 Nondeterminism as Unbounded Parallelism -- 14 Nondeterministic Finite Automata -- 15 Nondeterminism as Unbounded Search -- 16 Complexity Theory -- V: Pillar P: PRESENTATION/SPECIFICATION -- 17 The Elements of Formal Language Theory -- A A Chapter-Long Text on Discrete Mathematics -- B Selected Exercises, by Chapter -- List of ACRONYMS and SYMBOLS -- References -- Index.
520			_aComputation theory is a discipline that uses mathematical concepts and tools to expose the nature of "computation" and to explain a broad range of 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? How does one reason about such questions? This unique textbook strives to endow students with conceptual and manipulative tools necessary to make computation theory part of their professional lives. The work achieves this goal by means of three stratagems that set its approach apart from most other texts on the subject. For starters, it develops the necessary mathematical concepts and tools from the concepts' simplest instances, thereby helping students gain operational control over the required mathematics. Secondly, it organizes development of theory around four "pillars," enabling students to see computational topics that have the same intellectual origins in physical proximity to one another. Finally, the text illustrates the "big ideas" that computation theory is built upon with applications of these ideas within "practical" domains in mathematics, computer science, computer engineering, and even further afield. Suitable for advanced undergraduate students and beginning graduates, this textbook augments the "classical" models that traditionally support courses on computation theory with novel models inspired by "real, modern" computational topics,such as crowd-sourced computing, mobile computing, robotic path planning, and volunteer computing. Arnold L. Rosenberg is Distinguished Univ. Professor Emeritus at University of Massachusetts, Amherst, USA. Lenwood S. Heath is Professor at Virgina Tech, Blacksburg, USA. .
700	1		_aHeath, Lenwood S _eautor _0(orcid)0000-0003-1608-431X _1https://orcid.org/0000-0003-1608-431X _4aut _4http://id.loc.gov/vocabulary/relators/aut
776	0	8	_iPrinted edition: _z9783031100543
776	0	8	_iPrinted edition: _z9783031100567
776	0	8	_iPrinted edition: _z9783031100574
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-10055-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
988			_aSpringer_Computer_2022
999			_c394892 _d394892