LEADER 07519nam 22008415 450 001 9910483765103321 005 20251226195733.0 010 $a3-540-73001-X 024 7 $a10.1007/978-3-540-73001-9 035 $a(CKB)1000000000490408 035 $a(SSID)ssj0000316757 035 $a(PQKBManifestationID)11251758 035 $a(PQKBTitleCode)TC0000316757 035 $a(PQKBWorkID)10275413 035 $a(PQKB)10769327 035 $a(DE-He213)978-3-540-73001-9 035 $a(MiAaPQ)EBC3063285 035 $a(MiAaPQ)EBC6711192 035 $a(Au-PeEL)EBL6711192 035 $a(OCoLC)184905181 035 $a(PPN)123162904 035 $a(MiAaPQ)EBC337659 035 $a(BIP)32372602 035 $a(BIP)14225457 035 $a(EXLCZ)991000000000490408 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputation and Logic in the Real World $eThird Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings /$fedited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XVIII, 826 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4497 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-73000-1 320 $aIncludes bibliographical references and index. 327 $aShifting 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 Problems -- Characterizing Programming Systems Allowing Program Self-reference -- K-Trivial Closed Sets and Continuous Functions -- Pseudojump Operators and 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 Numbers -- Feasible 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 Semanticsfor Positive Relevant Logics Without Distribution -- Multi-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 ?-Definability with Applications to Computable Analysis -- Circuit Complexity of Regular Languages -- Definability 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 -- Hierarchies in Fragments of Monadic Strict NP -- Membrane Systems and Their Application to Systems Biology -- Some Aspects of a Complexity Theory for Continuous Time Systems -- Enumerations and Torsion Free Abelian Groups -- Locally Computable Structures -- Logic and Control -- Nash Stability in Additively Separable Hedonic Games Is NP-Hard -- Comparing Notions of Computational Entropy -- From Logic to Physics: How the Meaning of Computation Changed over Time -- Theories and Ordinals: Ordinal Analysis -- Computable Riemann Surfaces -- Rank Lower Bounds for the Sherali-Adams Operator -- Infinite Computations and a Hierarchy in ? 3 -- Natural Computing: A Natural and TimelyTrend for Natural Sciences and Science of Computation -- Biochemical Reactions as Computations -- Doing Without Turing Machines: Constructivism and Formal Topology -- Problems as Solutions -- A Useful Undecidable Theory -- On the Computational Power of Flip-Flop Proteins on Membranes -- Computability and Incomputability -- A Jump Inversion Theorem for the Degree Spectra -- Cupping Enumeration Degrees to 0 e ? -- What Is the Lesson of Quantum Computing? -- Does the Cell Compute? -- Computational Complexity of Constraint Satisfaction -- Finding Most Likely Solutions -- Turing Unbound: Transfinite Computation -- Computability in Amorphous Structures -- The Complexity of Small Universal Turing Machines -- Approximating Generalized Multicut on Trees -- (Short) Survey of Real Hypercomputation -- Characterizing Programming Systems Allowing Program Self-reference. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4497 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aArtificial intelligence 606 $aBioinformatics 606 $aTheory of Computation 606 $aAlgorithms 606 $aMathematics of Computing 606 $aArtificial Intelligence 606 $aBioinformatics 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aArtificial intelligence. 615 0$aBioinformatics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aMathematics of Computing. 615 24$aArtificial Intelligence. 615 24$aBioinformatics. 676 $a511.352 702 $aCooper$b S. B$g(S. Barry), 702 $aLo?we$b Benedikt 702 $aSorbi$b Andrea$f1956- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483765103321 996 $aComputation and Logic in the Real World$9772257 997 $aUNINA