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 | ||
| 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 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability : an introduction to recursive function theory / Nigel Cutland
| Computability : an introduction to recursive function theory / Nigel Cutland |
| Autore | Cutland, Nigel |
| Pubbl/distr/stampa | Cambridge : Cambridge University Press, 1980 |
| Descrizione fisica | x, 251 p. ; 23 cm. |
| Disciplina | 519.4 |
| Soggetto topico |
Computable functions
Recursion theory |
| ISBN | 0521294657 |
| Classificazione |
AMS 03D
QA9.59.C87 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | en |
| Record Nr. | UNISALENTO-991000772779707536 |
Cutland, Nigel
|
||
| Cambridge : Cambridge University Press, 1980 | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Computability / / George Tourlakis
| Computability / / George Tourlakis |
| Autore | Tourlakis George J. |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (652 pages) |
| Disciplina | 511.3 |
| Soggetto topico | Computable functions |
| ISBN |
9783030832025
9783030832018 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996485671003316 |
Tourlakis George J.
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computability / / George Tourlakis
| Computability / / George Tourlakis |
| Autore | Tourlakis George J. |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (652 pages) |
| Disciplina | 511.3 |
| Soggetto topico | Computable functions |
| ISBN |
9783030832025
9783030832018 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910586582103321 |
Tourlakis George J.
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability and logic / George Boolos, Richard Jeffrey
| Computability and logic / George Boolos, Richard Jeffrey |
| Autore | Boolos, George |
| Pubbl/distr/stampa | Cambridge : Cambridge University Press, c1974 |
| Descrizione fisica | x, 262 p. : ill. ; 24 cm. |
| Disciplina | 511.35 |
| Altri autori (Persone) | Jeffrey, Richard C.author |
| Soggetto topico |
Computable functions
Recursive functions Symbolic logic |
| ISBN | 052120402X |
| Classificazione | AMS 03D |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000772999707536 |
Boolos, George
|
||
| Cambridge : Cambridge University Press, c1974 | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards
| Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards |
| Autore | Pour-El, Marian B. |
| Pubbl/distr/stampa | Berlin : Springer-Verlag, 1989 |
| Descrizione fisica | x, 206 p. ; 25 cm. |
| Disciplina | 511.3 |
| Altri autori (Persone) | Richards, J. Ianauthor |
| Collana | Perspectives in mathematical logic |
| Soggetto topico |
Computable functions
Mathematical analysis Physics |
| ISBN | 3540500359 |
| Classificazione |
AMS 03D80
AMS 03F60 AMS 46N |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000773159707536 |
Pour-El, Marian B.
|
||
| Berlin : Springer-Verlag, 1989 | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910461306003321 |
| London, : Imperial College Press | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910789411903321 |
| London, : Imperial College Press | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability theory / Rebecca Weber
| Computability theory / Rebecca Weber |
| Autore | Weber, Rebecca |
| Pubbl/distr/stampa | Providence, R. I. : American Mathematical Society, c2012 |
| Descrizione fisica | vii, 203 p. : ill. ; 22 cm |
| Disciplina | 511.352 |
| Collana | Student mathematical library, 1520-9121 ; 62 |
| Soggetto topico |
Recursion theory
Computable functions |
| ISBN | 9780821873922 |
| Classificazione |
AMS 03D
AMS 68Q LC QA9.6.W43 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001839319707536 |
Weber, Rebecca
|
||
| Providence, R. I. : American Mathematical Society, c2012 | ||
| Lo trovi qui: Univ. del Salento | ||
| ||