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