1. CiE 2005: Amsterdam, The Netherlands

• S. Barry Cooper:
  Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It. 1-7
  
• George Barmpalias:
  Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. 8-17
  
• Josef Berger:
  The Fan Theorem and Uniform Continuity. 18-22
  
• Ulrich Berger:
  Continuous Semantics for Strong Normalization. 23-34
  
• Jan A. Bergstra, C. A. Middelburg:
  A Thread Algebra with Multi-level Strategic Interleaving. 35-48
  
• Francesco Bernardini, Marian Gheorghe, Natalio Krasnogor, Germán Terrazas:
  Membrane Computing - Current Results and Future Problems. 49-53
  
• Udi Boker, Nachum Dershowitz:
  How to Compare the Power of Computational Models. 54-64
  
• Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri:
  Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages. 65-67
  
• Harry Buhrman:
  Quantum Computing. 68-68
  
• Angelo Cangelosi:
  Symbol Grounding in Connectionist and Adaptive Agent Models. 69-74
  
• Douglas A. Cenzer, Jeffrey B. Remmel:
  The Complexity of Inductive Definability. 75-85
  
• Thierry Coquand:
  A Logical Approach to Abstract Algebra. 86-95
  
• Rodney G. Downey, Wolfgang Merkle, Jan Reimann:
  Schnorr Dimension. 96-105
  
• Jérôme Durand-Lose:
  Abstract Geometrical Computation: Turing-Computing Ability and Undecidability. 106-116
  
• Abbas Edalat, Ali Asghar Khanban, André Lieutier:
  Computability in Computational Geometry. 117-127
  
• Amin Farjudian:
  Shrad: A Language for Sequential Real Number Computation. 128-128
  
• Olivier Finkel:
  Borel Ranks and Wadge Degrees of Context Free omega-Languages. 129-138
  
• Artur S. d'Avila Garcez:
  Fewer Epistemological Challenges for Connectionism. 139-149
  
• Ricard Gavaldà:
  An Algebraic View on Exact Learning from Queries. 150-151
  
• Dina Q. Goldin, Peter Wegner:
  The Church-Turing Thesis: Breaking the Myth. 152-168
  
• Daniel S. Graça, Manuel Lameiras Campagnolo, Jorge Buescu:
  Robust Simulations of Turing Machines with Analytic Maps and Flows. 169-179
  
• Joel David Hamkins:
  Infinitary Computability with Infinite Time Turing Machines. 180-187
  
• Tero Harju:
  Combinatorial Models of Gene Assembly. 188-195
  
• Charles M. Harris:
  Symmetric Enumeration Reducibility. 196-208
  
• Denis R. Hirschfeldt:
  Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory. 209-210
  
• Herman Ruge Jervell:
  Finite Trees as Ordinals. 211-220
  
• Iskander Sh. Kalimullin:
  On the Problems of Definability in the Enumeration Degrees. 221-222
  
• Peter Koepke:
  Computing a Model of Set Theory. 223-232
  
• Ulrich Kohlenbach:
  Proof Mining in Functional Analysis. 233-234
  
• Margarita V. Korovina, Oleg V. Kudinov:
  Towards Computability of Higher Type Continuous Data. 235-241
  
• Shankara Narayanan Krishna:
  The Power of Mobility: Four Membranes Suffice. 242-251
  
• Lars Kristiansen, Mathias Barra:
  The Small Grzegorczyk Classes and the Typed lambda-Calculus. 252-262
  
• Lars Kristiansen, Neil D. Jones:
  The Flow of Data and the Complexity of Algorithms. 263-274
  
• Andrew E. M. Lewis:
  On a Question of Sacks - A Partial Solution on the Positive Side. 275-286
  
• Angsheng Li:
  The Low Splitting Theorem in the Difference Hierarchy. 287-296
  
• André Lieutier:
  Geometric Software: Robustness Issues and Model of Computation. 297-298
  
• Jack H. Lutz:
  The Dimension of a Point: Computability Meets Fractal Geometry. 299-299
  
• Florin Manea, Carlos Martín-Vide, Victor Mitrana:
  Accepting Networks of Splicing Processors. 300-309
  
• Yuri Matiyasevich:
  Hilbert's Tenth Problem and Paradigms of Computation. 310-321
  
• Klaus Meer:
  On Some Relations Between Approximation Problems and PCPs over the Real Numbers. 322-331
  
• Krzysztof Michalak, Halina Kwasnicka:
  Correlation Dimension and the Quality of Forecasts Given by a Neural Network. 332-341
  
• Peter Bro Miltersen:
  The Computational Complexity of One-Dimensional Sandpiles. 342-348
  
• Andrey Morozov:
  Categoricity in Restricted Classes. 349-349
  
• Yiannis N. Moschovakis:
  Recursion and Complexity. 350-357
  
• Marcin Mostowski, Konrad Zdanowski:
  FM-Representability and Beyond. 358-367
  
• Milad Niqui:
  Formalising Exact Arithmetic in Type Theory. 368-377
  
• Geoffrey E. Ostrin, Stanley S. Wainer:
  Complexity in Predicative Arithmetic. 378-384
  
• Dirk Pattinson:
  Domain-Theoretic Formulation of Linear Boundary Value Problems. 385-395
  
• Gheorghe Paun:
  Membrane Computing: Power, Efficiency, Applications. 396-407
  
• Thanases Pheidas, Xavier Vidaux:
  The Analogue of Büchi's Problem for Polynomials. 408-417
  
• Robert Rettinger, Xizhong Zheng:
  On the Turing Degrees of Divergence Bounded Computable Reals. 418-428
  
• Uwe Schöning:
  New Algorithmic Paradigms in Exponential Time Algorithms. 429-429
  
• Victor L. Selivanov:
  Some Reducibilities on Regular Sets. 430-439
  
• Wilfried Sieg:
  Computability and Discrete Dynamical Systems. 440-440
  
• Ivan N. Soskov:
  Uniform Operators. 441-450
  
• Alexandra A. Soskova:
  Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures. 451-460
  
• Frank Stephan, Guohua Wu:
  Presentations of K-Trivial Reals and Kolmogorov Complexity. 461-469
  
• Alexey Stukachev:
  Presentations of Structures in Admissible Sets. 470-478
  
• Germán Terrazas, Natalio Krasnogor, Marian Gheorghe, Francesco Bernardini, Steve Diggle, Miguel Cámara:
  An Environment Aware P-System Model of Quorum Sensing. 479-485
  
• Sebastiaan Terwijn:
  Kripke Models, Distributive Lattices, and Medvedev Degrees. 486-494
  
• Jacobo Torán:
  Arthur-Merlin Games and the Problem of Isomorphism Testing. 495-506
  
• Giuseppe Trautteur:
  Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality. 507-514
  
• J. V. Tucker, Jeffery I. Zucker:
  A Network Model of Analogue Computation over Metric Algebras. 515-529
  
• Klaus Weihrauch:
  Computable Analysis. 530-531
  
• Philip D. Welch:
  The Transfinite Action of 1 Tape Turing Machines. 532-539
  
• Damien Woods, J. Paul Gibson:
  Complexity of Continuous Space Machine Operations. 540-551
  
• Ning Zhong:
  Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation. 552-561
  
• Martin Ziegler:
  Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. 562-571
  

Last update Sun May 19 21:51:34 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page