Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms for Constructing Computably Enumerable Sets / / by Kenneth J. Supowit
| Algorithms for Constructing Computably Enumerable Sets / / by Kenneth J. Supowit |
| Autore | Supowit Kenneth J. |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2023 |
| Descrizione fisica | 1 online resource (191 pages) |
| Disciplina | 004.0151 |
| Collana | Computer Science Foundations and Applied Logic |
| Soggetto topico |
Computer science
Computable functions Recursion theory Set theory Computer science—Mathematics Theory of Computation Computability and Recursion Theory Set Theory Theory and Algorithms for Application Domains Mathematics of Computing Matemàtica discreta Teoria de conjunts Algorismes |
| Soggetto genere / forma | Llibres electrònics |
| ISBN |
9783031269042
9783031269035 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What’s new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises. |
| Record Nr. | UNINA-9910726280003321 |
Supowit Kenneth J.
|
||
| Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata Theory and Formal Languages : Fundamental Notions, Theorems, and Techniques / / by Alberto Pettorossi
| Automata Theory and Formal Languages : Fundamental Notions, Theorems, and Techniques / / by Alberto Pettorossi |
| Autore | Pettorossi Alberto |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (287 pages) |
| Disciplina | 004.019 |
| Collana | Undergraduate Topics in Computer Science |
| Soggetto topico |
Machine theory
Computer science Computable functions Recursion theory Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Computability and Recursion Theory Theory and Algorithms for Application Domains |
| ISBN |
9783031119651
9783031119644 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Formal Grammars and Languages -- 2 Finite Automata and Regular Grammars -- 3 Pushdown Automata and Context-Free Grammars -- 4 Linear Bounded Automata and Context-Sensitive Grammars -- 5 Turing Machines and Type 0 Grammars -- 6 Decidability and Undecidability in Context-Free Languages -- 7 Supplementary Topics. |
| Record Nr. | UNINA-9910586636603321 |
|
Pettorossi Alberto
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computable structure theory : a unified approach / / Rodney G. Downey, Alexander Melnikov
| Computable structure theory : a unified approach / / Rodney G. Downey, Alexander Melnikov |
| Autore | Downey R. G. ǂq (Rod G.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer, , [2026] |
| Descrizione fisica | 1 online resource (xii, 540 pages) : illustrations |
| Disciplina | 511.352 |
| Altri autori (Persone) | MelnikovAlexander |
| Collana | Theory and applications of computability, In cooperation with the Association Computability in Europe |
| Soggetto topico |
Computer science
Computer arithmetic and logic units Algorithms Computable functions Recursion theory Theory of Computation Arithmetic and Logic Structures Computability and Recursion Theory |
| ISBN | 9783031924330 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I Foundation of Computability -- 1. Introduction -- 2. Basics of Computability Theory -- 3. Computable Algebraic Structures -- 4. Computable Separable Spaces -- Part II Computable Duality -- 5. Computable Boolean Algebras -- 6. Computable Stone Spaces -- 7. Computable Abelian Groups -- 8. Computable Connected Compact Spaces -- Part III Computability and Classification Problems. 9. The Analytical Hierarchy and Σ11-completeness -- 10. Computable Categoricity -- 11. Computable Banach Spaces with Applications -- 12. Resource Bounded Computation -- Part IV Non-computability and Randomness. 13. Randomness -- 14. Degree Spectra -- 15 -- Computable Transfinite Analysis. |
| Record Nr. | UNINA-9911047799303321 |
|
Downey R. G. ǂq (Rod G.)
|
||
| Cham : , : Springer, , [2026] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Reverse Mathematics : Problems, Reductions, and Proofs / / by Damir D. Dzhafarov, Carl Mummert
| Reverse Mathematics : Problems, Reductions, and Proofs / / by Damir D. Dzhafarov, Carl Mummert |
| Autore | Dzhafarov Damir D. |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (498 pages) |
| Disciplina | 511.3 |
| Collana | Theory and Applications of Computability, In cooperation with the Association Computability in Europe |
| Soggetto topico |
Computer science - Mathematics
Computable functions Recursion theory Logic, Symbolic and mathematical Mathematics of Computing Computability and Recursion Theory Mathematical Logic and Foundations |
| ISBN | 3-031-11367-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 introduction -- Part I Computable mathematics: 2 Computability theory -- 3 Instance–solution problems -- 4 Problem reducibilities -- Part II Formalization and syntax: 5 Second order arithmetic -- 6 Induction and bounding -- 7 Forcing -- Part III Combinatorics: 8 Ramsey’s theorem -- 9 Other combinatorial principles -- Part IV Other areas: 10 Analysis and topology -- 11 Algebra -- 12 Set theory and beyond. |
| Record Nr. | UNINA-9910585784903321 |
|
Dzhafarov Damir D.
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
