CiE C

69 papers

YearTitle / Authors
2005A Logical Approach to Abstract Algebra.
Thierry Coquand
2005A Network Model of Analogue Computation over Metric Algebras.
John V. Tucker, Jeffery I. Zucker
2005A Thread Algebra with Multi-level Strategic Interleaving.
Jan A. Bergstra, Cornelis A. Middelburg
2005Abstract Geometrical Computation: Turing-Computing Ability and Undecidability.
Jérôme Durand-Lose
2005Accepting Networks of Splicing Processors.
Florin Manea, Carlos Martín-Vide, Victor Mitrana
2005An Algebraic View on Exact Learning from Queries.
Ricard Gavaldà
2005An Environment Aware P-System Model of Quorum Sensing.
Germán Terrazas, Natalio Krasnogor, Marian Gheorghe, Francesco Bernardini, Steve Diggle, Miguel Cámara
2005Arthur-Merlin Games and the Problem of Isomorphism Testing.
Jacobo Torán
2005Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality.
Giuseppe Trautteur
2005Borel Ranks and Wadge Degrees of Context Free omega-Languages.
Olivier Finkel
2005Categoricity in Restricted Classes.
Andrey Morozov
2005Combinatorial Models of Gene Assembly.
Tero Harju
2005Complexity in Predicative Arithmetic.
Geoffrey E. Ostrin, Stanley S. Wainer
2005Complexity of Continuous Space Machine Operations.
Damien Woods, J. Paul Gibson
2005Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.
Martin Ziegler
2005Computability and Discrete Dynamical Systems.
Wilfried Sieg
2005Computability in Computational Geometry.
Abbas Edalat, Ali Asghar Khanban, André Lieutier
2005Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory.
Denis R. Hirschfeldt
2005Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation.
Ning Zhong
2005Computable Analysis.
Klaus Weihrauch
2005Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees.
George Barmpalias
2005Computing a Model of Set Theory.
Peter Koepke
2005Continuous Semantics for Strong Normalization.
Ulrich Berger
2005Correlation Dimension and the Quality of Forecasts Given by a Neural Network.
Krzysztof Michalak, Halina Kwasnicka
2005Domain-Theoretic Formulation of Linear Boundary Value Problems.
Dirk Pattinson
2005FM-Representability and Beyond.
Marcin Mostowski, Konrad Zdanowski
2005Fewer Epistemological Challenges for Connectionism.
Artur S. d'Avila Garcez
2005Finite Trees as Ordinals.
Herman Ruge Jervell
2005Formalising Exact Arithmetic in Type Theory.
Milad Niqui
2005Geometric Software: Robustness Issues and Model of Computation.
André Lieutier
2005Hilbert's Tenth Problem and Paradigms of Computation.
Yuri V. Matiyasevich
2005How to Compare the Power of Computational Models.
Udi Boker, Nachum Dershowitz
2005Infinitary Computability with Infinite Time Turing Machines.
Joel David Hamkins
2005Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It.
S. Barry Cooper
2005Kripke Models, Distributive Lattices, and Medvedev Degrees.
Sebastiaan Terwijn
2005Membrane Computing - Current Results and Future Problems.
Francesco Bernardini, Marian Gheorghe, Natalio Krasnogor, Germán Terrazas
2005Membrane Computing: Power, Efficiency, Applications.
Gheorghe Paun
2005Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures.
Alexandra A. Soskova
2005New Algorithmic Paradigms in Exponential Time Algorithms.
Uwe Schöning
2005New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings
S. Barry Cooper, Benedikt Löwe, Leen Torenvliet
2005On Some Relations Between Approximation Problems and PCPs over the Real Numbers.
Klaus Meer
2005On a Question of Sacks - A Partial Solution on the Positive Side.
Andrew E. M. Lewis
2005On the Problems of Definability in the Enumeration Degrees.
Iskander Sh. Kalimullin
2005On the Turing Degrees of Divergence Bounded Computable Reals.
Robert Rettinger, Xizhong Zheng
2005Presentations of K-Trivial Reals and Kolmogorov Complexity.
Frank Stephan, Guohua Wu
2005Presentations of Structures in Admissible Sets.
Alexey Stukachev
2005Proof Mining in Functional Analysis.
Ulrich Kohlenbach
2005Quantum Computing.
Harry Buhrman
2005Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages.
Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri
2005Recursion and Complexity.
Yiannis N. Moschovakis
2005Robust Simulations of Turing Machines with Analytic Maps and Flows.
Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu
2005Schnorr Dimension.
Rodney G. Downey, Wolfgang Merkle, Jan Reimann
2005Shrad: A Language for Sequential Real Number Computation.
Amin Farjudian
2005Some Reducibilities on Regular Sets.
Victor L. Selivanov
2005Symbol Grounding in Connectionist and Adaptive Agent Models.
Angelo Cangelosi
2005Symmetric Enumeration Reducibility.
Charles M. Harris
2005The Analogue of Büchi's Problem for Polynomials.
Thanases Pheidas, Xavier Vidaux
2005The Church-Turing Thesis: Breaking the Myth.
Dina Q. Goldin, Peter Wegner
2005The Complexity of Inductive Definability.
Douglas A. Cenzer, Jeffrey B. Remmel
2005The Computational Complexity of One-Dimensional Sandpiles.
Peter Bro Miltersen
2005The Dimension of a Point: Computability Meets Fractal Geometry.
Jack H. Lutz
2005The Fan Theorem and Uniform Continuity.
Josef Berger
2005The Flow of Data and the Complexity of Algorithms.
Lars Kristiansen, Neil D. Jones
2005The Low Splitting Theorem in the Difference Hierarchy.
Angsheng Li
2005The Power of Mobility: Four Membranes Suffice.
Shankara Narayanan Krishna
2005The Small Grzegorczyk Classes and the Typed lambda-Calculus.
Lars Kristiansen, Mathias Barra
2005The Transfinite Action of 1 Tape Turing Machines.
Philip D. Welch
2005Towards Computability of Higher Type Continuous Data.
Margarita V. Korovina, Oleg V. Kudinov
2005Uniform Operators.
Ivan N. Soskov