Evolving computability : 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings /: 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings. (2015)

• Record Type: Book
• Other Titles: CiE 2015
• Further Information: Note: Edited by Arnold Beckmann, Victor Mitrana, Mariya Soskova.
• Editors: Beckmann, Arnold; Mitrana, Victor; Soskova, Mariya
• Other Names: Conference on Computability in Europe, 11th
• 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.
• Publisher Details: Cham : Springer
• Publication Date: 2015
• Extent: 1 online resource (xv, 363 pages), illustrations
• Subjects: 511.3/52; Computer science; Computable functions -- Congresses; Computer science -- Mathematics -- Congresses; Computable functions; Computer science -- Mathematics; Computer Science; Engineering & Applied Sciences; Computers -- Programming -- Algorithms; Computers -- Data Processing; Mathematics -- Logic; Computers -- Computer Science; Algorithms & data structures; Mathematical theory of computation; Life sciences: general issues; Computer software; Bioinformatics; Computers -- Machine Theory; User interface design & usability; Electronic books; Conference papers and proceedings; Electronic books
• Languages: English
• ISBNs: 9783319200286; 3319200283; 3319200275; 9783319200279
• Related ISBNs: 9783319200279
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed June 25, 2015).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.