Conferences in DBLP
Luigi Acerbi , Alberto Dennunzio , Enrico Formenti Shifting and Lifting of Cellular Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Pieter W. Adriaans Learning as Data Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender Reachability Problems: An Update. [Citation Graph (0, 0)][DBLP ] Conf ] Andrej Bauer , Christopher A. Stone RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice. [Citation Graph (0, 0)][DBLP ] Conf ] Francesco Bernardini , Marian Gheorghe , Maurice Margenstern , Sergey Verlan Producer/Consumer in Membrane Systems and Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Rongfang Bie , Guohua Wu A Minimal Pair in the Quotient Structure M / NCup . [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Bienvenu , David Doty , Frank Stephan Constructive Dimension and Weak Truth-Table Degrees. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Bonfante , Matthieu Kaczmarek , Jean-Yves Marion A Classification of Viruses Through Recursion Theorems. [Citation Graph (0, 0)][DBLP ] Conf ] Vasco Brattka , Guido Gherardi Borel Complexity of Topological Operations on Computable Metric Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Douglas S. Bridges Colocatedness and Lebesgue Integrability. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia Busi , Claudio Zandron Computing with Genetic Gates. [Citation Graph (0, 0)][DBLP ] Conf ] John Case Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. [Citation Graph (0, 0)][DBLP ] Conf ] John Case , Samuel E. Moelius Characterizing Programming Systems Allowing Program Self-reference. [Citation Graph (0, 0)][DBLP ] Conf ] George Barmpalias , Douglas A. Cenzer , Jeffrey B. Remmel , Rebecca Weber K -Trivial Closed Sets and Continuous Functions.Citation Graph (0, 0)][DBLP ] Conf ] Douglas A. Cenzer , Geoffrey LaForte , Guohua Wu Pseudojump Operators and P0 1 Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Cervelle , Enrico Formenti , Pierre Guillon Sofic Trace Subshift of a Cellular Automaton. [Citation Graph (0, 0)][DBLP ] Conf ] Chi Tat Chong , Liang Yu Thin Maximal Antichains in the Turing Degrees. [Citation Graph (0, 0)][DBLP ] Conf ] Pieter Collins Effective Computation for Nonlinear Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Andrés Cordón-Franco , Alejandro Fernández-Margarit , Francisco Félix Lara Martín On Rules and Parameter Free Systems in Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] José Félix Costa , Bruno Loff , Jerzy Mycka The New Promise of Analog Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Barbara F. Csima Comparing C.E. Sets Based on Their Settling Times. [Citation Graph (0, 0)][DBLP ] Conf ] Norman Danner , James S. Royer Time-Complexity Semantics for Feasible Affine Recursions. [Citation Graph (0, 0)][DBLP ] Conf ] Gregorio de Miguel Casado , Juan Manuel García Chamizo , Maria Teresa Signes Pont Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] David Doty , Philippe Moser Feasible Depth. [Citation Graph (0, 0)][DBLP ] Conf ] Jérôme Durand-Lose Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model. [Citation Graph (0, 0)][DBLP ] Conf ] Abbas Edalat A Continuous Derivative for Real-Valued Functions. [Citation Graph (0, 0)][DBLP ] Conf ] José Espírito Santo Refocusing Generalised Normalisation. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Fellows , Frances A. Rosamond The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Flum Parameterized Complexity and Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Ekaterina B. Fokina Index Sets of Computable Structures with Decidable Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Freixas , Xavier Molinero , Salvador Roura Minimal Representations for Majority Games. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Friedman Linear Transformations in Boolean Complexity Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Ganchev Exact Pair Theorem for the omega -Enumeration Degrees. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Gao , Jingde Cheng Operational Semantics for Positive Relevant Logics Without Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Giangiacomo Gerla Multi-valued Logics, Effectiveness and Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Guido Gherardi Internal Computability. [Citation Graph (0, 0)][DBLP ] Conf ] Joel David Hamkins , Russell G. Miller Post's Problem for Ordinal Register Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Hajime Ishihara Unique Existence and Computability in Constructive Reverse Mathematics. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjay Jain , Eric Martin , Frank Stephan Input-Dependence in Function-Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Iskander Sh. Kalimullin Some Notes on Degree Spectra of the Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Kentaro Kikuchi Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Aleksander Kolodziejczyk , Neil Thapen The Polynomial and Linear Hierarchies in V0 . [Citation Graph (0, 0)][DBLP ] Conf ] Margarita V. Korovina , Oleg V. Kudinov The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Koucký Circuit Complexity of Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Oleg V. Kudinov , Victor L. Selivanov Definability in the Homomorphic Quasiorder of Finite Labeled Forests. [Citation Graph (0, 0)][DBLP ] Conf ] James Ladyman Physics and Computation: The Status of Landauer's Principle. [Citation Graph (0, 0)][DBLP ] Conf ] James I. Lathrop , Jack H. Lutz , Scott M. Summers Strict Self-assembly of Discrete Sierpinski Triangles. [Citation Graph (0, 0)][DBLP ] Conf ] Gyesik Lee Binary Trees and (Maximal) Order Types. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Lewis , Antonio Montalbán , André Nies A Weakly 2-Random Set That Is Not Generalized Low. [Citation Graph (0, 0)][DBLP ] Conf ] Chung-Chih Li Speed-Up Theorems in Type-2 Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Joel David Hamkins , David Linetsky , Russell Miller The Complexity of Quickly ORM-Decidable Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Remco Loos On Accepting Networks of Splicing Processors of Size 3. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Maass Liquid Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Emilia Maietti Quotients over Minimal Type Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Florin Manea , Victor Mitrana Hairpin Completion Versus Hairpin Reduction. [Citation Graph (0, 0)][DBLP ] Conf ] Barnaby Martin , Florent R. Madelaine Hierarchies in Fragments of Monadic Strict NP. [Citation Graph (0, 0)][DBLP ] Conf ] Giancarlo Mauri Membrane Systems and Their Application to Systems Biology. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Gori , Klaus Meer Some Aspects of a Complexity Theory for Continuous Time Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander G. Melnikov Enumerations and Torsion Free Abelian Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Russell G. Miller Locally Computable Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Nerode Logic and Control. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Olsen Nash Stability in Additively Separable Hedonic Games Is NP-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandre Pinto Comparing Notions of Computational Entropy. [Citation Graph (0, 0)][DBLP ] Conf ] Itamar Pitowsky From Logic to Physics: How the Meaning of Computation Changed over Time. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Rathjen Theories and Ordinals: Ordinal Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Rettinger Computable Riemann Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Rhodes Rank Lower Bounds for the Sherali-Adams Operator. [Citation Graph (0, 0)][DBLP ] Conf ] Branislav Rovan , L'ubos Steskal Infinite Computations and a Hierarchy in Delta 3 . [Citation Graph (0, 0)][DBLP ] Conf ] Grzegorz Rozenberg Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Ehrenfeucht , Grzegorz Rozenberg Biochemical Reactions as Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Sambin Doing Without Turing Machines: Constructivism and Formal Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Schuster Problems as Solutions. [Citation Graph (0, 0)][DBLP ] Conf ] Victor L. Selivanov A Useful Undecidable Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Shankara Narayanan Krishna On the Computational Power of Flip-Flop Proteins on Membranes. [Citation Graph (0, 0)][DBLP ] Conf ] Robert I. Soare Computability and Incomputability. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandra A. Soskova A Jump Inversion Theorem for the Degree Spectra. [Citation Graph (0, 0)][DBLP ] Conf ] Mariya Ivanova Soskova , Guohua Wu Cupping D2 0 Enumeration Degrees to 0 e '. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher G. Timpson What Is the Lesson of Quantum Computing? [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Trautteur Does the Cell Compute? [Citation Graph (0, 0)][DBLP ] Conf ] Heribert Vollmer Computational Complexity of Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] Conf ] Osamu Watanabe , Mikael Onsjö Finding Most Likely Solutions. [Citation Graph (0, 0)][DBLP ] Conf ] Philip D. Welch Turing Unbound: Transfinite Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Wiedermann , Lukás Petru Computability in Amorphous Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Damien Woods , Turlough Neary The Complexity of Small Universal Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Peng Zhang Approximating Generalized Multicut on Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Ziegler (Short) Survey of Real Hypercomputation. [Citation Graph (0, 0)][DBLP ] Conf ] 