The Pillars of Computation Theory : State, Encoding, Nondeterminism

Computation 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 differenc...

पूर्ण विवरण

में बचाया:
ग्रंथसूची विवरण
मुख्य लेखक: Rosenberg, Arnold L., 1941-
स्वरूप: Livre numérique
भाषा:Anglais
प्रकाशित: New York, NY : Springer New York 2010.
Cham : Springer Nature
संस्करण:First.
श्रृंखला:Universitext
ऑनलाइन पहुंच:Accès sur la plateforme de l'éditeur
https://revue-sommaire.istex.fr/ark:/67375/8Q1-4FP7B7C9-N
Accès Université d'Orléans
Accès INSA CVL
टिप्पणी: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• The pillars of computation theory, state, encoding, nondeterminism, Arnold L. Rosenberg, New York, Springer, 2010, 1 volume (xvii-324 pages), Universitext, 978-0-387-09638-4
• The Pillars of Computation Theory, Texte imprimé, 9780387561172
LEADER 04074nam a22003617a 4500
001 1403752
008 110106s2010 xx ||| |||| 00| 0 eng d
009 PPN149048874
020 |a 9780387096391 
041 0 |a eng 
082 |a 004.0151 
100 1 |a Rosenberg, Arnold L.,  |d 1941- 
245 1 0 |a The Pillars of Computation Theory :  |b State, Encoding, Nondeterminism   |c by Arnold L. Rosenberg. 
250 |a First. 
256 |a Données textuelles 
260 |a New York, NY :  |b Springer New York. 
260 |a Cham :  |b Springer Nature,  |c 2010. 
490 0 |a Universitext  |x 2191-6675 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 1 |a PROLEGOMENA 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 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a Computation 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 
538 |a Nécessite un lecteur de fichier PDF 
776 0 |0 139272240  |t The pillars of computation theory  |o state, encoding, nondeterminism  |f Arnold L. Rosenberg  |c New York  |n Springer  |d 2010  |p 1 volume (xvii-324 pages)  |s Universitext  |z 978-0-387-09638-4 
776 0 |t The Pillars of Computation Theory  |b Texte imprimé  |z 9780387561172 
856 4 |q PDF  |u https://doi.org/10.1007/978-0-387-09639-1  |z Accès sur la plateforme de l'éditeur 
856 4 |q PDF  |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-4FP7B7C9-N 
856 4 |5 452349901:876780796  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/978-0-387-09639-1  |z Accès Université d'Orléans 
856 4 |5 180339901:87678404X  |u uhttps://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/978-0-387-09639-1  |z Accès INSA CVL 
997 |0 1403752  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/