Beyond the Horizon of Computability
Springer International Publishing (Verlag)
978-3-030-51465-5 (ISBN)
The 30 full and 5 short papers presented in this volume were carefully reviewed and selected from 72 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2020 had as its motto Beyond the Horizon of Computability, reflecting the interest of CiE in research transgressing the traditional boundaries of computability theory.
A Note on Computable Embeddings for Ordinals and Their Reverses.- Clockability for Ordinal Turing Machines.- Some notes on spaces of ideals and computable topology.- Parallelizations in Weihrauch reducibility and constructive reverse mathematics.- Liouville Numbers and the Computational Complexity of Changing Bases.- On Interpretability between some weak essential undecidable theories.- On the Complexity of Conversion between Classic Real Number Representations.- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power.- Computable analysis and classification problems.- Non-coding enumeration operators.- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings.- An interactive proof system for Program extraction.- ASNP: a tame fragment of existential second-order logic.- Ackermannian Goodstein sequences of intermediate growth.- On the complexity of validity degrees in Lukasiewicz logic.- Degrees of non-computability of homeomorphism types of Polish spaces.- Time-aware uniformization of winning strategies.- Quantitative Representation Theory of Compact Metric Spaces.- Functions of Baire class one over a Bishop topology.- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences.- The Computational Significance of Hausdorff's Maximal Chain Principle.- Prefix of trace languages: clique polynomials and dependency graphs.- Repetitions in Toeplitz words and the Thue threshold.- Simulation of automata networks.- Theoretical and Implementation Aspects of the Formal Language Server (LaSer).- Balancing Straight-Line Programs for Strings and Trees.- Two-dimensional codes.- Formal Languages in Graph Databases and Information Extraction.- On the perceptron's compression.- #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method.- Faster Online Computation of the Succinct Longest Previous Factor Array.- Recent advances in text-to-pattern distance algorithms.- Insertion-Deletion Systems With Substitutions: The Context-free Case.
| Erscheinungsdatum | 29.06.2020 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XXXVII, 379 p. 21 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 640 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Netzwerke |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Schlagworte | Applications • Artificial Intelligence • Automata Theory • Communication Systems • Computational Linguistics • Computer Hardware • Computer Networks • Computer Science • Computer systems • conference proceedings • Databases • Engineering • Formal Languages • Formal Logic • graph theory • Informatics • Internet • Linguistics • Mathematics • Network Protocols • Research • Semantics • Signal Processing • theoretical computer science |
| ISBN-10 | 3-030-51465-X / 303051465X |
| ISBN-13 | 978-3-030-51465-5 / 9783030514655 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
