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 / / Kenneth J. Supowit
| Algorithms for constructing computably enumerable sets / / Kenneth J. Supowit |
| Autore | Supowit Kenneth J. |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (191 pages) |
| Disciplina | 004.0151 |
| Collana | Computer Science Foundations and Applied Logic Series |
| Soggetto topico |
Algorithms
Set theory |
| ISBN |
9783031269042
9783031269035 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996546834203316 |
Supowit Kenneth J.
|
||
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 | ||
| ||