Search results for "CiE"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Jérôme Durand-Lose	Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal.	CiE	2006	DBLP DOI BibTeX RDF	2-counter automata, Reversibility, Conservativeness, Turing-computability, Rational numbers, Abstract geometrical computation
1	Peter Schuster 0001, Júlia Zappe	Do Noetherian Modules Have Noetherian Basis Functions?.	CiE	2006	DBLP DOI BibTeX RDF
1	Andrew E. M. Lewis	The Jump Classes of Minimal Covers.	CiE	2006	DBLP DOI BibTeX RDF
1	Andreas Weiermann	Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions.	CiE	2006	DBLP DOI BibTeX RDF
1	Merlijn Sevenster, Tero Tulenheimo	Partially Ordered Connectives and Sum11 on Finite Models.	CiE	2006	DBLP DOI BibTeX RDF	Henkin quantifiers, partially ordered connectives, NP vs. coNP, finite model theory
1	Sophie Laplante	Lower Bounds Using Kolmogorov Complexity.	CiE	2006	DBLP DOI BibTeX RDF
1	Mihai Prunescu	Fast Quantifier Elimination Means P = NP.	CiE	2006	DBLP DOI BibTeX RDF
1	Charles M. Harris	Enumeration Reducibility with Polynomial Time Bounds.	CiE	2006	DBLP DOI BibTeX RDF
1	Roland Carl Backhouse	Datatype-Generic Reasoning.	CiE	2006	DBLP DOI BibTeX RDF	allegory, generic programming, relation algebra, programming methodology, Datatype
1	Xizhong Zheng	A Computability Theory of Real Numbers.	CiE	2006	DBLP DOI BibTeX RDF
1	Wilfried Sieg	Gödel's Conflicting Approaches to Effective Calculability.	CiE	2006	DBLP DOI BibTeX RDF
1	Ugo Dal Lago, Simone Martini 0001	An Invariant Cost Model for the Lambda Calculus.	CiE	2006	DBLP DOI BibTeX RDF
1	Paul Brodhead, Douglas Cenzer, Seyyed Dashti	Random Closed Sets.	CiE	2006	DBLP DOI BibTeX RDF	?01 Classes, Computability, Randomness
1	Benedikt Löwe	Space Bounds for Infinitary Computation.	CiE	2006	DBLP DOI BibTeX RDF
1	Alexandra A. Soskova	Relativized Degree Spectra.	CiE	2006	DBLP DOI BibTeX RDF
1	Johannes Köbler	On Graph Isomorphism for Restricted Graph Classes.	CiE	2006	DBLP DOI BibTeX RDF
1	Oleg V. Kudinov, Victor L. Selivanov	Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.	CiE	2006	DBLP DOI BibTeX RDF	homomorphic quasiorder, elementary theory, Tree, undecidability, forest, labeled tree
1	Arnon Avron	From Constructibility and Absoluteness to Computability and Domain Independence.	CiE	2006	DBLP DOI BibTeX RDF
1	Barnaby Martin, Florent R. Madelaine	Towards a Trichotomy for Quantified H-Coloring.	CiE	2006	DBLP DOI BibTeX RDF
1	Philip D. Welch	Non-deterministic Halting Times for Hamkins-Kidder Turing Machines.	CiE	2006	DBLP DOI BibTeX RDF
1	Guido Gherardi	An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability.	CiE	2006	DBLP DOI BibTeX RDF	Borel Measurability, Urysohn Lemma, Urysohn-Tietze Lemma, Computable Analysis
1	Torkel Franzén	What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?	CiE	2006	DBLP DOI BibTeX RDF
1	Jan A. Bergstra	Elementary Algebraic Specifications of the Rational Function Field.	CiE	2006	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Ulrich Berger 0001, Benedikt Löwe, John V. Tucker (eds.)	Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings	CiE	2006	DBLP DOI BibTeX RDF
1	Lars Kristiansen	Complexity-Theoretic Hierarchies.	CiE	2006	DBLP DOI BibTeX RDF	subrecursive classes, ?-calculi, Gödel’s T, types, Complexity theory
1	Margarita V. Korovina, Nicolai N. Vorobjov Jr.	Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems.	CiE	2006	DBLP DOI BibTeX RDF
1	Shankara Narayanan Krishna	Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes.	CiE	2006	DBLP DOI BibTeX RDF
1	Stefan S. Dantchev	On the Complexity of the Sperner Lemma.	CiE	2006	DBLP DOI BibTeX RDF
1	Douglas Cenzer, Zia Uddin	Logspace Complexity of Functions and Structures.	CiE	2006	DBLP DOI BibTeX RDF	Complexity, Computability, Computable Model Theory
1	István Németi, Hajnal Andréka	Can General Relativistic Computers Break the Turing Barrier?.	CiE	2006	DBLP DOI BibTeX RDF
1	John W. Dawson Jr.	Gödel and the Origins of Computer Science.	CiE	2006	DBLP DOI BibTeX RDF
1	Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu	Robust Simulations of Turing Machines with Analytic Maps and Flows.	CiE	2005	DBLP DOI BibTeX RDF
1	Gheorghe Paun	Membrane Computing: Power, Efficiency, Applications.	CiE	2005	DBLP DOI BibTeX RDF
1	Joel David Hamkins	Infinitary Computability with Infinite Time Turing Machines.	CiE	2005	DBLP DOI BibTeX RDF
1	Dina Q. Goldin, Peter Wegner	The Church-Turing Thesis: Breaking the Myth.	CiE	2005	DBLP DOI BibTeX RDF
1	Robert Rettinger, Xizhong Zheng	On the Turing Degrees of Divergence Bounded Computable Reals.	CiE	2005	DBLP DOI BibTeX RDF
1	Florin Manea, Carlos Martín-Vide, Victor Mitrana	Accepting Networks of Splicing Processors.	CiE	2005	DBLP DOI BibTeX RDF
1	S. Barry Cooper, Benedikt Löwe, Leen Torenvliet (eds.)	New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings	CiE	2005	DBLP DOI BibTeX RDF
1	Harry Buhrman	Quantum Computing.	CiE	2005	DBLP DOI BibTeX RDF
1	Andrey Morozov 0002	Categoricity in Restricted Classes.	CiE	2005	DBLP DOI BibTeX RDF
1	Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri	Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages.	CiE	2005	DBLP DOI BibTeX RDF
1	Andrew E. M. Lewis	On a Question of Sacks - A Partial Solution on the Positive Side.	CiE	2005	DBLP DOI BibTeX RDF
1	Angelo Cangelosi	Symbol Grounding in Connectionist and Adaptive Agent Models.	CiE	2005	DBLP DOI BibTeX RDF
1	Damien Woods, J. Paul Gibson	Complexity of Continuous Space Machine Operations.	CiE	2005	DBLP DOI BibTeX RDF
1	Alexey Stukachev	Presentations of Structures in Admissible Sets.	CiE	2005	DBLP DOI BibTeX RDF
1	Giuseppe Trautteur	Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality.	CiE	2005	DBLP DOI BibTeX RDF
1	Marcin Mostowski, Konrad Zdanowski	FM-Representability and Beyond.	CiE	2005	DBLP DOI BibTeX RDF
1	Thierry Coquand	A Logical Approach to Abstract Algebra.	CiE	2005	DBLP DOI BibTeX RDF
1	Jérôme Durand-Lose	Abstract Geometrical Computation: Turing-Computing Ability and Undecidability.	CiE	2005	DBLP DOI BibTeX RDF	Analog model of computation, Turing universality, Cellular automata, Geometry, Abstract geometrical computation
1	Lars Kristiansen, Neil D. Jones	The Flow of Data and the Complexity of Algorithms.	CiE	2005	DBLP DOI BibTeX RDF
1	Germán Terrazas, Natalio Krasnogor, Marian Gheorghe 0001, Francesco Bernardini, Steve Diggle, Miguel Cámara	An Environment Aware P-System Model of Quorum Sensing.	CiE	2005	DBLP DOI BibTeX RDF
1	S. Barry Cooper	Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It.	CiE	2005	DBLP DOI BibTeX RDF
1	Martin Ziegler 0001	Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.	CiE	2005	DBLP DOI BibTeX RDF
1	Jan A. Bergstra, Cornelis A. Middelburg	A Thread Algebra with Multi-level Strategic Interleaving.	CiE	2005	DBLP DOI BibTeX RDF
1	Denis R. Hirschfeldt	Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory.	CiE	2005	DBLP DOI BibTeX RDF
1	Iskander Sh. Kalimullin	On the Problems of Definability in the Enumeration Degrees.	CiE	2005	DBLP DOI BibTeX RDF
1	André Lieutier	Geometric Software: Robustness Issues and Model of Computation.	CiE	2005	DBLP DOI BibTeX RDF
1	Sebastiaan Terwijn	Kripke Models, Distributive Lattices, and Medvedev Degrees.	CiE	2005	DBLP DOI BibTeX RDF
1	Frank Stephan 0001, Guohua Wu	Presentations of K-Trivial Reals and Kolmogorov Complexity.	CiE	2005	DBLP DOI BibTeX RDF
1	Philip D. Welch	The Transfinite Action of 1 Tape Turing Machines.	CiE	2005	DBLP DOI BibTeX RDF
1	Uwe Schöning	New Algorithmic Paradigms in Exponential Time Algorithms.	CiE	2005	DBLP DOI BibTeX RDF
1	John V. Tucker, Jeffery I. Zucker	A Network Model of Analogue Computation over Metric Algebras.	CiE	2005	DBLP DOI BibTeX RDF
1	Klaus Weihrauch	Computable Analysis.	CiE	2005	DBLP DOI BibTeX RDF
1	George Barmpalias	Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees.	CiE	2005	DBLP DOI BibTeX RDF
1	Lars Kristiansen, Mathias Barra	The Small Grzegorczyk Classes and the Typed lambda-Calculus.	CiE	2005	DBLP DOI BibTeX RDF
1	Ning Zhong 0002	Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation.	CiE	2005	DBLP DOI BibTeX RDF
1	Peter Koepke	Computing a Model of Set Theory.	CiE	2005	DBLP DOI BibTeX RDF
1	Victor L. Selivanov	Some Reducibilities on Regular Sets.	CiE	2005	DBLP DOI BibTeX RDF
1	Shankara Narayanan Krishna	The Power of Mobility: Four Membranes Suffice.	CiE	2005	DBLP DOI BibTeX RDF
1	Ulrich Kohlenbach	Proof Mining in Functional Analysis.	CiE	2005	DBLP DOI BibTeX RDF
1	Rodney G. Downey, Wolfgang Merkle, Jan Reimann 0001	Schnorr Dimension.	CiE	2005	DBLP DOI BibTeX RDF
1	Alexandra A. Soskova	Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures.	CiE	2005	DBLP DOI BibTeX RDF
1	Olivier Finkel	Borel Ranks and Wadge Degrees of Context Free omega-Languages.	CiE	2005	DBLP DOI BibTeX RDF
1	Josef Berger	The Fan Theorem and Uniform Continuity.	CiE	2005	DBLP DOI BibTeX RDF
1	Wilfried Sieg	Computability and Discrete Dynamical Systems.	CiE	2005	DBLP DOI BibTeX RDF
1	Klaus Meer	On Some Relations Between Approximation Problems and PCPs over the Real Numbers.	CiE	2005	DBLP DOI BibTeX RDF
1	Ivan N. Soskov	Uniform Operators.	CiE	2005	DBLP DOI BibTeX RDF
1	Artur S. d'Avila Garcez	Fewer Epistemological Challenges for Connectionism.	CiE	2005	DBLP DOI BibTeX RDF
1	Krzysztof Michalak, Halina Kwasnicka	Correlation Dimension and the Quality of Forecasts Given by a Neural Network.	CiE	2005	DBLP DOI BibTeX RDF
1	Peter Bro Miltersen	The Computational Complexity of One-Dimensional Sandpiles.	CiE	2005	DBLP DOI BibTeX RDF
1	Charles M. Harris	Symmetric Enumeration Reducibility.	CiE	2005	DBLP DOI BibTeX RDF
1	Douglas A. Cenzer, Jeffrey B. Remmel	The Complexity of Inductive Definability.	CiE	2005	DBLP DOI BibTeX RDF
1	Ulrich Berger 0001	Continuous Semantics for Strong Normalization.	CiE	2005	DBLP DOI BibTeX RDF
1	Francesco Bernardini, Marian Gheorghe 0001, Natalio Krasnogor, Germán Terrazas	Membrane Computing - Current Results and Future Problems.	CiE	2005	DBLP DOI BibTeX RDF
1	Tero Harju	Combinatorial Models of Gene Assembly.	CiE	2005	DBLP DOI BibTeX RDF
1	Udi Boker, Nachum Dershowitz	How to Compare the Power of Computational Models.	CiE	2005	DBLP DOI BibTeX RDF
1	Geoffrey E. Ostrin, Stanley S. Wainer	Complexity in Predicative Arithmetic.	CiE	2005	DBLP DOI BibTeX RDF	provable recursion, ordinal analysis, slow growing hierarchy
1	Ricard Gavaldà	An Algebraic View on Exact Learning from Queries.	CiE	2005	DBLP DOI BibTeX RDF
1	Jacobo Torán	Arthur-Merlin Games and the Problem of Isomorphism Testing.	CiE	2005	DBLP DOI BibTeX RDF
1	Herman Ruge Jervell	Finite Trees as Ordinals.	CiE	2005	DBLP DOI BibTeX RDF
1	Yuri V. Matiyasevich	Hilbert's Tenth Problem and Paradigms of Computation.	CiE	2005	DBLP DOI BibTeX RDF
1	Angsheng Li	The Low Splitting Theorem in the Difference Hierarchy.	CiE	2005	DBLP DOI BibTeX RDF
1	Yiannis N. Moschovakis	Recursion and Complexity.	CiE	2005	DBLP DOI BibTeX RDF
1	Amin Farjudian	Shrad: A Language for Sequential Real Number Computation.	CiE	2005	DBLP DOI BibTeX RDF
1	Margarita V. Korovina, Oleg V. Kudinov	Towards Computability of Higher Type Continuous Data.	CiE	2005	DBLP DOI BibTeX RDF
1	Jack H. Lutz	The Dimension of a Point: Computability Meets Fractal Geometry.	CiE	2005	DBLP DOI BibTeX RDF
1	Milad Niqui	Formalising Exact Arithmetic in Type Theory.	CiE	2005	DBLP DOI BibTeX RDF
1	Abbas Edalat, Ali Asghar Khanban, André Lieutier	Computability in Computational Geometry.	CiE	2005	DBLP DOI BibTeX RDF
1	Thanases Pheidas, Xavier Vidaux	The Analogue of Büchi's Problem for Polynomials.	CiE	2005	DBLP DOI BibTeX RDF
1	Dirk Pattinson	Domain-Theoretic Formulation of Linear Boundary Value Problems.	CiE	2005	DBLP DOI BibTeX RDF

Publications at "CiE"( http://dblp.L3S.de/Venues/CiE )