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