Evolving Computability (eBook)

11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings

Arnold Beckmann, Victor Mitrana, Mariya Soskova (Herausgeber)

eBook Download: PDF

2015 | 2015
XV, 363 Seiten
Springer International Publishing (Verlag)
978-3-319-20028-6 (ISBN)

Infos

This book constitutes the refereed proceedings of the 11th Conference on Computability in Europe, CiE 2015, held in Bucharest, Romania, in June/July 2015.The 26 revised papers presented were carefully reviewed and selected from 64 submissions and included together with 10 invited papers in this proceedings. The conference CiE 2015 has six special sessions: two sessions, Representing Streams and Reverse Mathematics, were introduced for the first time in the conference series. In addition to this, new developments in areas frequently covered in the CiE conference series were addressed in the further special sessions on Automata, Logic and Infinite Games; Bio-inspired Computation; Classical Computability Theory; as well as History and Philosophy of Computing.

Inhalt

Computers and the Mechanics of Communication. Outline of a Vision from the Work of Petri and Holt.- Error and predicativity.- Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems.- A New Approach to the Paperfolding Sequences.- Covering the Recursive Sets.- On Distributed Monitoring and Synthesis.- Newton's Forward Difference Equation for Functions from Words to Words.- Degrees of unsolvability: a tutorial.- Universality in Molecular and Cellular Computing.- Some results on interactive proofs for real computations.- Prime Model with No Degree of Autostability Relative to Strong Constructivizations.- Immune Systems in Computer Virology.- ITRM-Recognizability from Random Oracles.- Systems with Parallel Rewriting for Chain Code Picture Languages.- Base-Complexity Classifications of QCB0-Spaces (Extended Abstract).- Maximal Vector Spaces form an Automorphism Basis.- New Bounds on Optimal Sorting Networks.- Nonexistence of Minimal Pairs in L[d].- Intuitionistic Provability versus Uniform Provability in RCA.- Randomness and Differentiability of Convex Functions.- Weighted automata on infinite words in the context of Attacker-Defender games.- Turing jumps through provability.- Rice's Theorem in Effectively Enumerable Topological Spaces.- Decidability of Termination Problems for Sequential P Systems with Active Membranes.- Weihrauch degrees of finding equilibria in sequential games.- Prefix and Right-Partial Derivative Automata.- A Note on the Computable Categoricity of l^p Spaces.- n the Computational Content of Termination Proofs.- Local compactness for computable Polish metric spaces is $/Pi^1_1$-complete.- Iterative forcing and hyperimmunity in reverse mathematics.- Completely regular Bishop spaces.- Computing Equality-Free String Factorisations.- Towards the Effective Descriptive Set Theory.- On Computability of Navier-Stokes' Equation.- Undecidability as a Consequence of Incompleteness.- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems.

Produkt-Details

• Erscheint lt. Verlag: 19.6.2015
• Reihe/Serie: Lecture Notes in Computer Science
• Reihe/Serie: Theoretical Computer Science and General Issues
• Verlagsort: Cham
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik
• Schlagworte: analog computation • Bioinformatics and bio-inspired computation • Classical computability and degree structures • Computable analysis and real computation • Computable structures and models • DNA computing • Emerging and non-standard models of computation • Generalized recursion theory • History of computation • Hypercomputational models • Infinite time turing machines • Natural Computation • Physics and computability • proof complexity • Proof theory and computability • Quantum computing and complexity • Relativistic computation • Semantics and logic of computation • Swarm intelligence and self-organisation • uncertain reasoning
• ISBN-10: 3-319-20028-3 / 3319200283
• ISBN-13: 978-3-319-20028-6 / 9783319200286