Website Search
Find information on spaces, staff, and services.
Catalog Search
Computer file; Books
Computation and logic in the real world : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007 : proceedings
- Author / Creator
- Conferences
- Conference on Computability in Europe (3rd : 2007 : Siena, Italy)
- Available as
- Online
- Summary
-
This book constitutes the refereed proceedings of the Third International Conference on Computability in Europe, CiE 2007, held in Sienna, Italy, in June 2007. The 50 revised full papers presented ...
This book constitutes the refereed proceedings of the Third International Conference on Computability in Europe, CiE 2007, held in Sienna, Italy, in June 2007. The 50 revised full papers presented together with 36 invited papers were carefully reviewed and selected from 167 submissions. Among them are papers corresponding to 12 plenary talks and papers of 8 special sessions entitled doing without turing machines: constructivism and formal topology, approaches to computational learning, real computation, computability and mathematical structure, complexity of algorithms and proofs, logic and ne.
Details
- Creator
- S. Barry Cooper, Benedikt Löwe, Andrea Sorbi (eds.)
- Format
- Computer file; Books
- Language
- English
- Contributors
- Publication
-
- Berlin ; New York : Springer, [2007]
- ©2007
- Physical Details
-
- 1 online resource (xviii, 826 pages) : illustrations
- text file
- ISBNs
- 3540730001, 354073001X, 9783540730002, 9783540730019
- OCLC
- ocn184905181
- Includes bibliographical references and index.
- Front Matter; Shifting and Lifting of Cellular Automata; Learning as Data Compression; Reachability Problems: An Update; RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice; Producer/Consumer in Membrane Systems and Petri Nets; A Minimal Pair in the Quotient Structure M / NCup; Constructive Dimension and Weak Truth-Table Degrees; A Classification of Viruses Through Recursion Theorems; Borel Complexity of Topological Operations on Computable Metric Spaces; Colocatedness and Lebesgue Integrability; Computing with Genetic Gates
- Resource Restricted Computability Theoretic Learning: Illustrative Topics and ProblemsCharacterizing Programming Systems Allowing Program Self-reference; K -Trivial Closed Sets and Continuous Functions; Pseudojump Operators and P01 Classes; Sofic Trace Subshift of a Cellular Automaton; Thin Maximal Antichains in the Turing Degrees; Effective Computation for Nonlinear Systems; On Rules and Parameter Free Systems in Bounded Arithmetic; The New Promise of Analog Computation; Comparing C.E. Sets Based on Their Settling Times; Time-Complexity Semantics for Feasible Affine Recursions
- Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational NumbersFeasible Depth; Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model; A Continuous Derivative for Real-Valued Functions; Refocusing Generalised Normalisation; The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number; Parameterized Complexity and Logic; Index Sets of Computable Structures with Decidable Theories; Minimal Representations for Majority Games; Linear Transformations in Boolean Complexity Theory; Exact Pair Theorem for the .-Enumeration Degrees
- Operational Semantics for Positive Relevant Logics Without DistributionMulti-valued Logics, Effectiveness and Domains; Internal Computability; Post's Problem for Ordinal Register Machines; Unique Existence and Computability in Constructive Reverse Mathematics; Input-Dependence in Function-Learning; Some Notes on Degree Spectra of the Structures; Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus; The Polynomial and Linear Hierarchies in V0; The Uniformity Principle for S -Definability with Applications to Computable Analysis
- Circuit Complexity of Regular LanguagesDefinability in the Homomorphic Quasiorder of Finite Labeled Forests; Physics and Computation: The Status of Landauer's Principle; Strict Self-assembly of Discrete Sierpinski Triangles; Binary Trees and (Maximal) Order Types; A Weakly 2-Random Set That Is Not Generalized Low; Speed-Up Theorems in Type-2 Computation; The Complexity of Quickly ORM-Decidable Sets; On Accepting Networks of Splicing Processors of Size 3; Liquid Computing; Quotients over Minimal Type Theory; Hairpin Completion Versus Hairpin Reduction