CiE 2009: Mathematical Theory and Computational Practice Heidelberg, Germany, July 19-24, 2009 After several years of research activity, the informal cooperation "C- putability in Europe" decided to take a more formal status at their meeting in Athens in June 2008: the Association for Computability in Europe was founded to promote the development, particularly in Europe, of computability-related science, ranging over mathematics, computer science, and applications in va- ous natural and engineering sciences such as physics and biology, including the promotion of the study of philosophy and history of computing as it relates to questionsofcomputability. As mentioned,this associationbuilds ontheinformal network of European scientists working on computability theory that had been supporting the conference series CiE-CS overthe years,and nowbecame its new home. The aims of the conference series remain unchanged: to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines.
Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 29 mm
Gewicht
ISBN-13
978-3-642-03072-7 (9783642030727)
DOI
10.1007/978-3-642-03073-4
Schweitzer Klassifikation
First-Order Universality for Real Programs.- Skolem + Tetration Is Well-Ordered.- Structures of Some Strong Reducibilities.- Complexity of Existential Positive First-Order Logic.- Stochastic Programs and Hybrid Automata for (Biological) Modeling.- Numberings and Randomness.- The Strength of the Grätzer-Schmidt Theorem.- Hyperloops Do Not Threaten the Notion of an Effective Procedure.- Minimum Entropy Combinatorial Optimization Problems.- Program Self-reference in Constructive Scott Subdomains.- and Equivalence Structures.- Immunity for Closed Sets.- Lower Bounds for Kernelizations and Other Preprocessing Procedures.- Infinite-Time Turing Machines and Borel Reducibility.- Cutting Planes and the Parameter Cutwidth.- Members of Random Closed Sets.- Lowness for Demuth Randomness.- Graph States and the Necessity of Euler Decomposition.- On Stateless Multicounter Machines.- Computability of Continuous Solutions of Higher-Type Equations.- Equivalence Relations on Classes of Computable Structures.- Fractals Generated by Algorithmically Random Brownian Motion.- Computable Exchangeable Sequences Have Computable de Finetti Measures.- Spectra of Algebraic Fields and Subfields.- Definability in the Local Theory of the ?-Enumeration Degrees.- Computability of Analytic Functions with Analytic Machines.- An Application of Martin-Löf Randomness to Effective Probability Theory.- Index Sets and Universal Numberings.- Ordinal Computability.- A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.- Constructing New Aperiodic Self-simulating Tile Sets.- Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem.- The First Order Theories of the Medvedev and Muchnik Lattices.- Infima of d.r.e. Degrees.- A Divergence Formula forRandomness and Dimension.- On Ladner's Result for a Class of Real Machines with Restricted Use of Constants.- 0?-Categorical Completely Decomposable Torsion-Free Abelian Groups.- Notes on the Jump of a Structure.- A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability.- Stability under Strategy Switching.- Computational Heuristics for Simplifying a Biological Model.- Functions Definable by Arithmetic Circuits.- Survey on Oblivious Routing Strategies.- An Approach to the Engineering of Cellular Models Based on P Systems.- Decidability of Sub-theories of Polynomials over a Finite Field.- Chaitin ? Numbers and Halting Problems.- Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria.- Dialectica Interpretation with Fine Computational Control.- Algorithmic Minimal Sufficient Statistic Revisited.- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets.- On Generating Independent Random Strings.
