CiE C

37 papers

YearTitle / Authors
2015A New Approach to the Paperfolding Sequences.
Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit
2015A Note on the Computable Categoricity of \ell ^p ℓ p Spaces.
Timothy H. McNicholl
2015Base-Complexity Classifications of QCB
Matthew de Brecht, Matthias Schröder, Victor L. Selivanov
2015Completely Regular Bishop Spaces.
Iosif Petrakis
2015Computers and the Mechanics of Communication - Outline of a Vision from the Work of Petri and Holt.
Felice Cardone
2015Computing Equality-Free String Factorisations.
Markus L. Schmid
2015Covering the Recursive Sets.
Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
2015Decidability of Termination Problems for Sequential P Systems with Active Membranes.
Michal Kovác
2015Degrees of Unsolvability: A Tutorial.
Stephen G. Simpson
2015Error and Predicativity.
Laura Crosilla
2015Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings
Arnold Beckmann, Victor Mitrana, Mariya Ivanova Soskova
2015How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems.
Jeroen Van der Meeren, Andreas Weiermann
2015ITRM I T R M -Recognizability from Random Oracles.
Merlin Carl
2015Immune Systems in Computer Virology.
Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup
2015Intuitionistic Provability versus Uniform Provability in \mathsfRCA RCA.
Makoto Fujiwara
2015Is Human Mind Fully Algorithmic? Remarks on Kurt Gödel's Incompleteness Theorems.
Mircea Dumitru
2015Iterative Forcing and Hyperimmunity in Reverse Mathematics.
Ludovic Patey
2015Kalmár and Péter: Undecidability as a Consequence of Incompleteness.
Máté Szabó
2015Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -complete.
André Nies, Slawomir Solecki
2015New Bounds on Optimal Sorting Networks.
Thorsten Ehlers, Mike Müller
2015Newton's Forward Difference Equation for Functions from Words to Words.
Jean-Éric Pin
2015Nonexistence of Minimal Pairs in L[d].
Chengling Fang, Jiang Liu, Guohua Wu, Mars M. Yamaleev
2015On Computability of Navier-Stokes' Equation.
Shu-Ming Sun, Ning Zhong, Martin Ziegler
2015On Distributed Monitoring and Synthesis.
Anca Muscholl
2015On the Computational Content of Termination Proofs.
Georg Moser, Thomas Powell
2015P Systems with Parallel Rewriting for Chain Code Picture Languages.
Rodica Ceterchi, K. G. Subramanian, Ibrahim Venkat
2015Prefix and Right-Partial Derivative Automata.
Eva Maia, Nelma Moreira, Rogério Reis
2015Prime Model with No Degree of Autostability Relative to Strong Constructivizations.
Nikolay Bazhenov
2015Randomness and Differentiability of Convex Functions.
Alex Galicki
2015Rice's Theorem in Effectively Enumerable Topological Spaces.
Margarita V. Korovina, Oleg V. Kudinov
2015Some Results on Interactive Proofs for Real Computations.
Martijn Baartse, Klaus Meer
2015Towards the Effective Descriptive Set Theory.
Victor L. Selivanov
2015Turing Jumps Through Provability.
Joost J. Joosten
2015Unconventional Computing: Do We Dream Too Much?
Gheorghe Paun
2015Universality in Molecular and Cellular Computing.
Sergey Verlan
2015Weighted Automata on Infinite Words in the Context of Attacker-Defender Games.
Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov
2015Weihrauch Degrees of Finding Equilibria in Sequential Games.
Stéphane Le Roux, Arno Pauly