Cover image for Evolving Computability 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings
Title:
Evolving Computability 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings
Author:
Beckmann, Arnold. editor.
ISBN:
9783319200286
Edition:
1st ed. 2015.
Physical Description:
XV, 363 p. 20 illus. online resource.
Series:
Theoretical Computer Science and General Issues, 9136
Contents:
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.
Added Corporate Author:
Holds:
Copies:

Available:*

Library
Material Type
Item Barcode
Shelf Number
Status
Item Holds
Searching...
E-Book 519060-1001 XX(519060.1)
Searching...

On Order