
Author

Title


Hajnal Andréka 
Relativity theory for logicians and new computing paradigms 

Marat Arslanov 
Generalized tabular reducibilities in infinite levels of Ershov hierarchy 

Josef Berger 
The logical strength of the uniform continuity theorem 

Jens Blanck 
Note on Reducibility Between Domain Representations 

Paul Brodhead, Douglas Cenzer and Seyyed Dashti 
Random Closed Sets 

Riccardo Bruni 
Gödel, Turing, the Undecidability Results and the Nature of Human Mind 

Douglas Cenzer and Zia Uddin 
Logspace Complexity of Functions and Structures 

Alexey Chernov and Juergen Schmidhuber 
Prefixlike Complexities and Computability in the Limit 

Jose Felix Costa and Jerzy Mycka 
The conjecture P ≠ NP given by some analytic condition 

Paolo Cotogno 
Decidability of arithmetic through hypercomputation: a logical objection 

Fredrik Dahlgren 
Partial Continuous Functions and Admissible Domain Representations 

Stefan Dantchev 
On the complexity of the Sperner Lemma 

Gregorio de Miguel Casado and Juan Manuel García Chamizo 
The Role of Algebraic Models and Type2 Theory of Effectivity in Special 

Paulin Jacobe de Naurois 
A Measure of Space for Computing over the Reals 

Pavel Demenkov 
Computer simulation replacements aminoacids in proteins 

David Doty 
Every sequence is decompressible from a random one 

Jérôme DurandLose 
Reversible conservative rational abstract geometrical computation is Turinguniversal 

Birgit Elbl 
On generalising predicate abstraction 

Willem Fouche 
Brownian motion and Kolmogorov complexity 

Gaßner Christine 
A Structure with P = NP 

Gaßner Christine 
Expansions of Structures with P = NP 

Alexander Gavryushkin 
On Complexity of Ehrenfeucht Theories with Computable Model 

Philipp Gerhardy 
Functional interpretation and modified realizability interpretation of the doublenegation shift 

Guido Gherardi 
An Analysis of Urysohn and TietzeUrysohn Lemmas according to Borel Computability 

Lev Gordeev 
Toward combinatorial proof of P < NP. Basic approach 

Neal Harman 
Models of Timing Abstraction in Simultaneous Multithreaded and MultiCore Processors 

Charles Milton Harris 
Enumeration reducibility with polynomial time bounds 

Eiju Hirowatari, Kouichi Hirata and Tetsuhiro Miyahara 
Finite Prediction of Recursive RealValued Functions 

Tie Hou 
Coinductive Proof for Basic Real Computation 

Iskander Kalimullin 
The Dyment reducibility on the algebraic structures and on the families of subsets of ω 

Dazhou Kang, Baowen Xu, Jianjiang Lu and Yanhui Li 
Reasoning within the Extended Fuzzy Description Logics with Restricted TBoxes 

Peter Koepke 
Infinite time register machines 

Peter Koepke and Ryan Siders 
Computing the Recursive Truth Predicate on Ordinal Register Machines 

Ekaterina Komendantskaya and Anthony Seda 
Bilatticebased Logic Programs: Automated Reasoning and Neural Computation 

Krishna Shankara Narayanan 
Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes 

Lars Kristiansen 
ComplexityTheoretic Hierarchies 

Oleg Kudinov and Victor Selivanov 
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests 

Ugo Dal Lago and Simone Martini 
An Invariant Cost Model for the Lambda Calculus 

Andrew Edwin Marcus Lewis 
The jump classes of minimal covers 

ChungChih Li 
Clocking Type2 Computation in The Unit Cost Model 

John Longley 
On the calculating power of Laplace's demon 

Maria LopezValdes 
Scaled Dimension of Individual Strings 

Barnaby Martin and Florent Madelaine 
Towards a trichotomy for quantified Hcoloring. 

Klaus Meer and Martin Ziegler 
Uncomputability below and up to the Real Halting Problem 

Greg Michaelson and Paul Cockshott 
Constraints on hypercomputation 

Philippe Moser 
Martingale Families and Dimension in P 

Benedek Nagy and Sándor Vályi 
Solving a PSPACEcomplete problem by a linear intervalvalued computation 

Keng Meng Ng, Frank Stephan and Guohua Wu 
Degrees of weakly computable reals 

Peter Peshev and Dimiter Skordev 
A subrecursive refinement of the fundamental theorem of algebra 

Petrus Hendrik Potgieter 
Hypercomputing the Mandelbrot Set? 

Vadim Puzarenko 
Definability of the Field of Reals in Admissible Sets 

Rose Hafsah Abdul Rauf 
Integrating Functional Programming Into C++:Implementation and Verification 

Peter Schuster and Júlia Zappe 
Do Noetherian modules have Noetherian basis functions? 

Victor Selivanov 
The Algebra of Labeled Forests Modulo Homomorphic Equivalence 

Anton Setzer 
Partial Recursive Functions in MartinLöf Type Theory 

Merlijn Sevenster and Tero Tulenheimo 
Partially ordered connectives and ∑_{1}^{1} on finite models 

Alan Skelley 
ThirdOrder Computation and Bounded Arithmetic 

Boris Solon 
Cototal enumeration degrees 

Alexandra Soskova 
Relativized Degree Spectra 

Alexey Stukachev 
On inner constructivizability of admissible sets 

Andreas Weiermann and Arnoud den Boer 
A sharp phase transition threshold for elementary descent recursive functions 

Albert Ziegler 
Some Reflections on the Principle of Image Collection 

Jeffery Zucker 
Primitive Recursive Selection Functions over Abstract Algebras 