default search action
11. CiE 2015: Bucharest, Romania
- Arnold Beckmann, Victor Mitrana
, Mariya Ivanova Soskova:
Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings. Lecture Notes in Computer Science 9136, Springer 2015, ISBN 978-3-319-20027-9
Invited Papers
- Felice Cardone:
Computers and the Mechanics of Communication - Outline of a Vision from the Work of Petri and Holt. 3-12 - Laura Crosilla
Error and Predicativity. 13-22 - Mircea Dumitru:
Is Human Mind Fully Algorithmic? Remarks on Kurt Gödel's Incompleteness Theorems. 23-33 - Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
A New Approach to the Paperfolding Sequences. 34-43 - Bjørn Kjos-Hanssen, Frank Stephan
Covering the Recursive Sets. 44-53 - Anca Muscholl:
On Distributed Monitoring and Synthesis. 54-62 - Gheorghe Paun:
Unconventional Computing: Do We Dream Too Much? 63-70 - Jean-Éric Pin:
Newton's Forward Difference Equation for Functions from Words to Words. 71-82 - Stephen G. Simpson
Degrees of Unsolvability: A Tutorial. 83-94 - Sergey Verlan
Universality in Molecular and Cellular Computing. 95-104
Contributed Papers
- Martijn Baartse, Klaus Meer:
Some Results on Interactive Proofs for Real Computations. 107-116 - Nikolay Bazhenov
Prime Model with No Degree of Autostability Relative to Strong Constructivizations. 117-126 - Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup:
Immune Systems in Computer Virology. 127-136 - Merlin Carl:
ITRM I T R M -Recognizability from Random Oracles. 137-144 - Rodica Ceterchi, K. G. Subramanian, Ibrahim Venkat:
P Systems with Parallel Rewriting for Chain Code Picture Languages. 145-155 - Matthew de Brecht, Matthias Schröder
Base-Complexity Classifications of QCB0-Spaces. 156-166 - Thorsten Ehlers, Mike Müller:
New Bounds on Optimal Sorting Networks. 167-176 - Chengling Fang, Jiang Liu, Guohua Wu, Mars M. Yamaleev
Nonexistence of Minimal Pairs in L[d]. 177-185 - Makoto Fujiwara:
Intuitionistic Provability versus Uniform Provability in \mathsfRCA RCA. 186-195 - Alex Galicki:
Randomness and Differentiability of Convex Functions. 196-205 - Vesa Halava, Tero Harju
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games. 206-215 - Joost J. Joosten:
Turing Jumps Through Provability. 216-225 - Margarita V. Korovina, Oleg V. Kudinov
Rice's Theorem in Effectively Enumerable Topological Spaces. 226-235 - Michal Kovác:
Decidability of Termination Problems for Sequential P Systems with Active Membranes. 236-245 - Stéphane Le Roux, Arno Pauly
Weihrauch Degrees of Finding Equilibria in Sequential Games. 246-257 - Eva Maia
Prefix and Right-Partial Derivative Automata. 258-267 - Timothy H. McNicholl:
A Note on the Computable Categoricity of \ell ^p ℓ p Spaces. 268-275 - Georg Moser, Thomas Powell
On the Computational Content of Termination Proofs. 276-285 - André Nies
Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -complete. 286-290 - Ludovic Patey
Iterative Forcing and Hyperimmunity in Reverse Mathematics. 291-301 - Iosif Petrakis:
Completely Regular Bishop Spaces. 302-312 - Markus L. Schmid:
Computing Equality-Free String Factorisations. 313-323 - Victor L. Selivanov:
Towards the Effective Descriptive Set Theory. 324-333 - Shu-Ming Sun, Ning Zhong, Martin Ziegler:
On Computability of Navier-Stokes' Equation. 334-342 - Máté Szabó:
Kalmár and Péter: Undecidability as a Consequence of Incompleteness. 343-352 - Jeroen Van der Meeren, Andreas Weiermann
How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems. 353-362
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-03 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: