Connecting with Computability [[electronic resource] ] : 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings / / edited by Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (527 pages) |
Disciplina | 511.352 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science Computer science - Mathematics Artificial intelligence Data structures (Computer science) Information theory Theory of Computation Mathematics of Computing Artificial Intelligence Data Structures and Information Theory Computer Science Logic and Foundations of Programming |
ISBN | 3-030-80049-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Searching for Applicable Versions of Computable Structures -- On Measure Quantifiers in First-Order Arithmetic -- Pistone Learning Languages with Decidable Hypotheses -- Robust Online Algorithms for Dynamic Choosing Problems -- On the degrees of constructively immune sets -- Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry -- The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines -- Randomising Realizability -- Restrictions of Hindman’s Theorem: an overview -- Complexity and Categoricity of Automatic Injection structures -- A tale of optimizing the space taken by de Bruijn graphs -- Formally Computing with the Non-Computable -- Cohen Mapping Monotonic Restrictions in Inductive Inference -- Normal Forms for Semantically Witness-Based Learners in Inductive Inference -- xWalk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted -- On 3SUM-hard problems in the Decision Tree Model -- Monotonic Spectra and Their Generalizations -- On false Heine/Borel compactness principles in proof mining -- Placing Green Bridges Optimally, with a Multivariate Analysis -- A Church-Turing thesis for randomness? -- Probabilistic Models of k-mer Frequencies -- Defining Formal Explanation in Classical Logic by Substructural Derivability -- Dedekind Cuts and Long Strings of Zeros in Base Expansions -- On the impact of treewidth in the computational complexity of freezing dynamics -- Towards a Map for Incremental Learning in the Limit from Positive and Negative Information -- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy -- n search of the first-order part of Ramsey’s theorem for pairs -- On subrecursive representability of irrational numbers: Contractors and Baire sequences -- xiLearning -- Languages in the Limit from Positive Information with Finitely Many Memory Changes. |
Record Nr. | UNISA-996464490403316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Connecting with Computability : 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings / / edited by Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (527 pages) |
Disciplina | 511.352 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science Computer science - Mathematics Artificial intelligence Data structures (Computer science) Information theory Theory of Computation Mathematics of Computing Artificial Intelligence Data Structures and Information Theory Computer Science Logic and Foundations of Programming |
ISBN | 3-030-80049-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Searching for Applicable Versions of Computable Structures -- On Measure Quantifiers in First-Order Arithmetic -- Pistone Learning Languages with Decidable Hypotheses -- Robust Online Algorithms for Dynamic Choosing Problems -- On the degrees of constructively immune sets -- Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry -- The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines -- Randomising Realizability -- Restrictions of Hindman’s Theorem: an overview -- Complexity and Categoricity of Automatic Injection structures -- A tale of optimizing the space taken by de Bruijn graphs -- Formally Computing with the Non-Computable -- Cohen Mapping Monotonic Restrictions in Inductive Inference -- Normal Forms for Semantically Witness-Based Learners in Inductive Inference -- xWalk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted -- On 3SUM-hard problems in the Decision Tree Model -- Monotonic Spectra and Their Generalizations -- On false Heine/Borel compactness principles in proof mining -- Placing Green Bridges Optimally, with a Multivariate Analysis -- A Church-Turing thesis for randomness? -- Probabilistic Models of k-mer Frequencies -- Defining Formal Explanation in Classical Logic by Substructural Derivability -- Dedekind Cuts and Long Strings of Zeros in Base Expansions -- On the impact of treewidth in the computational complexity of freezing dynamics -- Towards a Map for Incremental Learning in the Limit from Positive and Negative Information -- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy -- n search of the first-order part of Ramsey’s theorem for pairs -- On subrecursive representability of irrational numbers: Contractors and Baire sequences -- xiLearning -- Languages in the Limit from Positive Information with Finitely Many Memory Changes. |
Record Nr. | UNINA-9910488690903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Reflections on Programming Systems : Historical and Philosophical Aspects / / edited by Liesbeth De Mol, Giuseppe Primiero |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (VIII, 286 p. 79 illus.) |
Disciplina | 601 |
Collana | Philosophical Studies Series |
Soggetto topico |
Technology - Philosophy
Operating systems (Computers) Computers - History Science - History Technology History Philosophy of Technology Operating Systems History of Computing History of Science History of Technology |
ISBN | 3-319-97226-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Preface -- Part I: Programming without Systems -- Chapter 1. Validity & Correctness before the OS: the case of LEO I and LEO II (Rabia Arif, Elisabetta Mori, Giuseppe Primiero) -- Chapter 2. What is an Operating System? A historical investigation (1954–1964) (Maarten Bullynck) -- Part II: Formalizing Systems -- Chapter 3. Formal Semantics of ALGOL 60: Four Descriptions in their Historical Context (Troy K. Astarte, Cliff B. Jones) -- Chapter 4. Sans-papiers as first-class citizens (Julian Rohrhuber) -- Part III: Creating Systems -- Chapter 5. Unix, Plan 9 and the Lurking Smalltalk (Stephen Kell) -- Chapter 6. Unix: Building a Development Environment from Scratch (Warren Toomey) -- Part IV: Evaluating Systems -- Chapter 7. Ethical Operating Systems (Naveen Sundar Govindarajulu, Selmer Bringsjord, Atriya Sen, Jean-Claude Paquin, Kevin O’Neill) -- Chapter 8. From Sovereign Operating Systems to the Sovereign Digital Chain (Gael Duval) -- Chapter 9. Elegance in Software (Robin K. Hill). |
Record Nr. | UNINA-9910309856203321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|