Speaker

Title

Bahareh Afshari 
Information Content and Computability in the nC.E. Hierarchy 
Hajnal Andréka 
Relativity theory for logicians and new computing paradigms (talk cancelled) 
Marat Arslanov 
Generalized tabular reducibilities in infinite levels of Ershov hierarchy (talk cancelled) 
Edwin Beggs 
Computing with Newtonian machines 
Josef Berger 
The logical strength of the uniform continuity theorem 
Jens Blanck 
Note on Reducibility Between Domain Representations 
Riccardo Bruni 
Gödel, Turing, the Undecidability Results and the Nature of Human Mind 
Douglas Cenzer 
Random Closed Sets 
Douglas Cenzer 
Logspace Complexity of Functions and Structures 
Alexey Chernov 
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: logical objections (talk cancelled) 
Fredrik Dahlgren 
Partial Continuous Functions and Admissible Domain Representations 
Ugo Dal Lago 
An Invariant Cost Model for the Lambda Calculus 
Stefan Dantchev 
On the complexity of the Sperner Lemma 
Barnaby Dawson 
Infinite Time Turing Computation 
Gregorio de Miguel Casado 
The Role of Algebraic Models and Type2 Theory of Effectivity in Special Purpose Processor Design 
Pavel Demenkov 
Computer simulation replacements aminoacids in proteins (talk cancelled) 
Costas Dimitracopoulos 
On a problem of J. Paris 
Karim Djemame 
Risk Management in Grid Computing 
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 
Christine Gaßner 
A Structure with P = NP 
Christine Gaßner 
Expansions of Structures with P = NP 
Alexander Gavryushkin 
On Complexity of Ehrenfeucht Theories with Computable Model 
Annelies Gerber 
Some Mathematical Properties of Input Resolution Refutations with NonTautological Resolvents 
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 
MirceaDan Hernest 
NdE  Normalization during Extraction 
Stefan Hetzl 
A Similarity Criterion for Proofs 
Eiju Hirowatari 
Finite Prediction of Recursive RealValued Functions 
Tie Hou 
Coinductive Proofs for Basic Real Computation 
Paulin Jacobe de Naurois 
A Measure of Space for Computing over the Reals 
Iskander Kalimullin 
The Dyment reducibility on the algebraic structures and on the families of subsets of $omega$ 
Akitoshi Kawamura 
On real primitive recursive functions and differential algebraicity 
Viv Kendon 
Nonunitary quantum walks: exploring the space between classical and quantum computing 
Peter Koepke 
Infinite time register machines 
Peter Koepke and Ryan Siders 
Computing the Recursive Truth Predicate on Ordinal Register Machines 
Ekaterina Komendantskaya 
Bilatticebased Logic Programs: Automated Reasoning and Neural Computation 
Juha Kontinen 
Logical characterization of the counting hierarchy 
Lars Kristiansen 
ComplexityTheoretic Hierarchies 
Victor Selivanov 
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests 
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 
Sheri Markose 
Gödelian Foundations of NonComputability and Heterogeneity In Economic Forecasting and Strategic Innovation 
Barnaby Martin 
Towards a trichotomy for quantified Hcoloring. 
Richard McKinley 
Sequent calculi and the identity of proofs 
Robert K Meyer 
The Key to the Universe, Part 2 
Greg Michaelson and Paul Cockshott 
Constraints on hypercomputation 
Liesbeth De Mol 
Questions Concerning the Usefulness of Small Universal Systems 
Morteza Moniri 
Basic Model Theory for Bounded Theories (talk cancelled) 
Philippe Moser 
Martingale Families and Dimension in P 
Keng Meng Ng et. al. 
Degrees of weakly computable reals 
Kerry Ojakian 
The Method of Approximation in Real Computation 
Peter Peshev 
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 
Ulrich Berger 
Integrating Functional Programming Into C++: Implementation and Verification 
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 
Krishna. S 
Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes (talk cancelled) 
Amit Shomrat 
Long games with a short memory 
Alan Skelley 
ThirdOrder Computation and Bounded Arithmetic 
Boris Solon 
Cototal enumeration degrees 
Ivan N. Soskov 
Extensions of the semilattice of the enumeration degrees 
Alexandra Soskova 
Relativized Degree Spectra 
Mariya Ivanova Soskova 
Genericity and Nonbounding 
Alexey Stukachev 
On inner constructivizability of admissible sets 
Sándor Vályi 
Solving a PSPACEcomplete problem by a linear intervalvalued computation 
Andreas Weiermann 
A sharp phase transition threshold for elementary descent recursive functions 
Marek Zaionc 
Asymptotic Densities in Logic 
Júlia Zappe 
Do Noetherian modules have Noetherian basis functions? (talk cancelled) 
Albert Ziegler 
Some Reflections on the Principle of Image Collection 
Martin Ziegler 
Uncomputability below and up to the Real Halting Problem 
Jeffery Zucker 
Primitive Recursive Selection Functions over Abstract Algebras 