Conferences in DBLP
Erika Ábrahám , Andreas Grüner , Martin Steffen Heap-Abstraction for an Object-Oriented Calculus with Thread Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Arnon Avron From Constructibility and Absoluteness to Computability and Domain Independence. [Citation Graph (0, 0)][DBLP ] Conf ] Roland Carl Backhouse Datatype-Generic Reasoning. [Citation Graph (0, 0)][DBLP ] Conf ] Josef Berger The Logical Strength of the Uniform Continuity Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Jan A. Bergstra Elementary Algebraic Specifications of the Rational Function Field. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Brodhead , Douglas Cenzer , Seyyed Dashti Random Closed Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Kai Brünnler Deep Inference and Its Normal Form of Derivations. [Citation Graph (0, 0)][DBLP ] Conf ] Douglas Cenzer , Zia Uddin Logspace Complexity of Functions and Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Alexey V. Chernov , Jürgen Schmidhuber Prefix-Like Complexities and Computability in the Limit. [Citation Graph (0, 0)][DBLP ] Conf ] Fredrik Dahlgren Partial Continuous Functions and Admissible Domain Representations. [Citation Graph (0, 0)][DBLP ] Conf ] Ugo Dal Lago , Simone Martini An Invariant Cost Model for the Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan S. Dantchev On the Complexity of the Sperner Lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Davis The Church-Turing Thesis: Consensus and Opposition. [Citation Graph (0, 0)][DBLP ] Conf ] John W. Dawson Jr. Gödel and the Origins of Computer Science. [Citation Graph (0, 0)][DBLP ] Conf ] Gregorio de Miguel Casado , Juan Manuel García Chamizo The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Charles Delvenne Turing Universality in Dynamical Systems. [Citation Graph (0, 0)][DBLP ] Conf ] David Doty Every Sequence Is Decompressible from a Random One. [Citation Graph (0, 0)][DBLP ] Conf ] Jérôme Durand-Lose Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. [Citation Graph (0, 0)][DBLP ] Conf ] Roy Dyckhoff , Stephane Lengrand LJQ: A Strongly Focused Calculus for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Ehrhard , Laurent Regnier Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Torkel Franzén What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? [Citation Graph (0, 0)][DBLP ] Conf ] Guido Gherardi An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. [Citation Graph (0, 0)][DBLP ] Conf ] Charles M. Harris Enumeration Reducibility with Polynomial Time Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Tie Hou Coinductive Proofs for Basic Real Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Paulin Jacobé de Naurois A Measure of Space for Computing over the Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Köbler On Graph Isomorphism for Restricted Graph Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Koepke Infinite Time Register Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Margarita V. Korovina , Nicolai Vorobjov Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Krajícek Forcing with Random Variables and Proof Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Kristiansen Complexity-Theoretic Hierarchies. [Citation Graph (0, 0)][DBLP ] Conf ] Oleg V. Kudinov , Victor L. Selivanov Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. [Citation Graph (0, 0)][DBLP ] Conf ] Sophie Laplante Lower Bounds Using Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew E. M. Lewis The Jump Classes of Minimal Covers. [Citation Graph (0, 0)][DBLP ] Conf ] Benedikt Löwe Space Bounds for Infinitary Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Johann A. Makowsky From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Barnaby Martin , Florent R. Madelaine Towards a Trichotomy for Quantified H -Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Elvira Mayordomo Two Open Problems on Effective Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Meer Optimization and Approximation Problems Related to Polynomial System Solving. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Meer , Martin Ziegler Uncomputability Below the Real Halting Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Michaelson , W. Paul Cockshott Constraints on Hypercomputation. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Moser Martingale Families and Dimension in P. [Citation Graph (0, 0)][DBLP ] Conf ] István Németi , Hajnal Andréka Can General Relativistic Computers Break the Turing Barrier?. [Citation Graph (0, 0)][DBLP ] Conf ] Keng Meng Ng , Frank Stephan , Guohua Wu Degrees of Weakly Computable Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Paulo Oliva Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Peshev , Dimiter Skordev A Subrecursive Refinement of the Fundamental Theorem of Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Alban Ponse , Mark van der Zwaag An Introduction to Program and Thread Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Prunescu Fast Quantifier Elimination Means P = NP. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Schröder Admissible Representations in Computable Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Schuster , Júlia Zappe Do Noetherian Modules Have Noetherian Basis Functions?. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Schwichtenberg Inverting Monotone Continuous Functions in Constructive Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Anton Setzer Partial Recursive Functions in Martin-Löf Type Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Merlijn Sevenster , Tero Tulenheimo Partially Ordered Connectives and Sum1 1 on Finite Models. [Citation Graph (0, 0)][DBLP ] Conf ] Shankara Narayanan Krishna Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes. [Citation Graph (0, 0)][DBLP ] Conf ] Wilfried Sieg Gödel's Conflicting Approaches to Effective Calculability. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Solon Co-total Enumeration Degrees. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandra A. Soskova Relativized Degree Spectra. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Weiermann Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Philip D. Welch Non-deterministic Halting Times for Hamkins-Kidder Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Zach Kurt Gödel and Computability Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Xizhong Zheng A Computability Theory of Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffery I. Zucker Primitive Recursive Selection Functions over Abstract Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] 