default search action
3. CiE 2007: Siena, Italy
- S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings. Lecture Notes in Computer Science 4497, Springer 2007, ISBN 978-3-540-73000-2 - Luigi Acerbi, Alberto Dennunzio, Enrico Formenti
:
Shifting and Lifting of Cellular Automata. 1-10 - Pieter W. Adriaans:
Learning as Data Compression. 11-24 - Eric Allender:
Reachability Problems: An Update. 25-27 - Andrej Bauer, Christopher A. Stone
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice. 28-42 - Francesco Bernardini, Marian Gheorghe
Producer/Consumer in Membrane Systems and Petri Nets. 43-52 - Rongfang Bie, Guohua Wu:
A Minimal Pair in the Quotient Structure M / NCup. 53-62 - Laurent Bienvenu, David Doty
Constructive Dimension and Weak Truth-Table Degrees. 63-72 - Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
A Classification of Viruses Through Recursion Theorems. 73-82 - Vasco Brattka
Borel Complexity of Topological Operations on Computable Metric Spaces. 83-97 - Douglas S. Bridges:
Colocatedness and Lebesgue Integrability. 98-104 - Nadia Busi, Claudio Zandron:
Computing with Genetic Gates. 105-114 - John Case:
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. 115-124 - John Case, Samuel E. Moelius:
Characterizing Programming Systems Allowing Program Self-reference. 125-134 - George Barmpalias
K -Trivial Closed Sets and Continuous Functions. 135-145 - Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu:
Pseudojump Operators and P01 Classes. 146-151 - Julien Cervelle, Enrico Formenti
Sofic Trace Subshift of a Cellular Automaton. 152-161 - Chi Tat Chong, Liang Yu:
Thin Maximal Antichains in the Turing Degrees. 162-168 - Pieter Collins:
Effective Computation for Nonlinear Systems. 169-178 - Andrés Cordón-Franco
On Rules and Parameter Free Systems in Bounded Arithmetic. 179-188 - José Félix Costa
The New Promise of Analog Computation. 189-195 - Barbara F. Csima:
Comparing C.E. Sets Based on Their Settling Times. 196-204 - Norman Danner, James S. Royer:
Time-Complexity Semantics for Feasible Affine Recursions. 205-217 - Gregorio de Miguel Casado, Juan Manuel García Chamizo, María Teresa Signes Pont
Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers. 218-227 - David Doty
Feasible Depth. 228-237 - Jérôme Durand-Lose:
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model. 238-247 - Abbas Edalat:
A Continuous Derivative for Real-Valued Functions. 248-257 - José Espírito Santo
Refocusing Generalised Normalisation. 258-267 - Michael R. Fellows
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. 268-277 - Jörg Flum:
Parameterized Complexity and Logic. 278-289 - Ekaterina B. Fokina
Index Sets of Computable Structures with Decidable Theories. 290-296 - Josep Freixas, Xavier Molinero
Minimal Representations for Majority Games. 297-306 - Joel Friedman
Linear Transformations in Boolean Complexity Theory. 307-315 - Hristo Ganchev:
Exact Pair Theorem for the omega -Enumeration Degrees. 316-324 - Ying Gao, Jingde Cheng:
Operational Semantics for Positive Relevant Logics Without Distribution. 325-335 - Giangiacomo Gerla:
Multi-valued Logics, Effectiveness and Domains. 336-347 - Guido Gherardi:
Internal Computability. 348-357 - Joel David Hamkins
Post's Problem for Ordinal Register Machines. 358-367 - Hajime Ishihara:
Unique Existence and Computability in Constructive Reverse Mathematics. 368-377 - Sanjay Jain, Eric Martin, Frank Stephan
Input-Dependence in Function-Learning. 378-388 - Iskander Sh. Kalimullin
Some Notes on Degree Spectra of the Structures. 389-397 - Kentaro Kikuchi:
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus. 398-407 - Leszek Aleksander Kolodziejczyk, Neil Thapen:
The Polynomial and Linear Hierarchies in V0. 408-415 - Margarita V. Korovina, Oleg V. Kudinov
The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis. 416-425 - Michal Koucký
Circuit Complexity of Regular Languages. 426-435 - Oleg V. Kudinov
Definability in the Homomorphic Quasiorder of Finite Labeled Forests. 436-445 - James Ladyman:
Physics and Computation: The Status of Landauer's Principle. 446-454 - James I. Lathrop, Jack H. Lutz, Scott M. Summers:
Strict Self-assembly of Discrete Sierpinski Triangles. 455-464 - Gyesik Lee:
Binary Trees and (Maximal) Order Types. 465-473 - Andrew E. M. Lewis, Antonio Montalbán, André Nies
A Weakly 2-Random Set That Is Not Generalized Low. 474-477 - Chung-Chih Li:
Speed-Up Theorems in Type-2 Computation. 478-487 - Joel David Hamkins
The Complexity of Quickly ORM-Decidable Sets. 488-496 - Remco Loos
On Accepting Networks of Splicing Processors of Size 3. 497-506 - Wolfgang Maass:
Liquid Computing. 507-516 - Maria Emilia Maietti:
Quotients over Minimal Type Theory. 517-531 - Florin Manea, Victor Mitrana
Hairpin Completion Versus Hairpin Reduction. 532-541 - Barnaby Martin, Florent R. Madelaine
Hierarchies in Fragments of Monadic Strict NP. 542-550 - Giancarlo Mauri
Membrane Systems and Their Application to Systems Biology. 551-553 - Marco Gori, Klaus Meer:
Some Aspects of a Complexity Theory for Continuous Time Systems. 554-565 - Alexander G. Melnikov
Enumerations and Torsion Free Abelian Groups. 566-574 - Russell G. Miller:
Locally Computable Structures. 575-584 - Anil Nerode:
Logic and Control. 585-597 - Martin Olsen
Nash Stability in Additively Separable Hedonic Games Is NP-Hard. 598-605 - Alexandre Pinto:
Comparing Notions of Computational Entropy. 606-620 - Itamar Pitowsky:
From Logic to Physics: How the Meaning of Computation Changed over Time. 621-631 - Michael Rathjen:
Theories and Ordinals: Ordinal Analysis. 632-637 - Robert Rettinger:
Computable Riemann Surfaces. 638-647 - Mark Nicholas Charles Rhodes:
Rank Lower Bounds for the Sherali-Adams Operator. 648-659 - Branislav Rovan, L'ubos Steskal:
Infinite Computations and a Hierarchy in Delta 3. 660-669 - Grzegorz Rozenberg:
Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation. 670-671 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Biochemical Reactions as Computations. 672-673 - Giovanni Sambin:
Doing Without Turing Machines: Constructivism and Formal Topology. 674-675 - Peter Schuster
Problems as Solutions. 676-684 - Victor L. Selivanov:
A Useful Undecidable Theory. 685-694 - Shankara Narayanan Krishna:
On the Computational Power of Flip-Flop Proteins on Membranes. 695-704 - Robert I. Soare:
Computability and Incomputability. 705-715 - Alexandra A. Soskova
A Jump Inversion Theorem for the Degree Spectra. 716-726 - Mariya Ivanova Soskova
Cupping D20 Enumeration Degrees to 0 e '. 727-738 - Christopher G. Timpson:
What Is the Lesson of Quantum Computing? 739-741 - Giuseppe Trautteur:
Does the Cell Compute? 742-747 - Heribert Vollmer:
Computational Complexity of Constraint Satisfaction. 748-757 - Osamu Watanabe, Mikael Onsjö:
Finding Most Likely Solutions. 758-767 - Philip D. Welch
Turing Unbound: Transfinite Computation. 768-780 - Jirí Wiedermann
Computability in Amorphous Structures. 781-790 - Damien Woods, Turlough Neary
The Complexity of Small Universal Turing Machines. 791-799 - Peng Zhang:
Approximating Generalized Multicut on Trees. 799-808 - Martin Ziegler:
(Short) Survey of Real Hypercomputation. 809-824
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-04 01:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: