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 differe...
Main Author: | |
---|---|
Format: | eBook |
Language: | English |
Published: |
New York, NY
Springer New York
2010, 2010
|
Edition: | 1st ed. 2010 |
Series: | Universitext
|
Subjects: | |
Online Access: | |
Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- 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