The Pillars of Computation Theory State, Encoding, Nondeterminism /

• Κύριος συγγραφέας: Rosenberg, Arnold L. (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2010.
• Έκδοση: First.
• Σειρά: Universitext
• Θέματα: Computer science.; Computers.; Algorithms.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Theory of Computation.; Mathematics of Computing.; Algorithm Analysis and Problem Complexity.; Mathematical Logic and Foundations.; Computation by Abstract Devices.; Mathematical Logic and Formal Languages.

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

Πίνακας περιεχομένων:

• 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.