000 05788nam a22006135i 4500
001 978-3-642-03073-4
003 DE-He213
005 20240730192738.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642030734
_9978-3-642-03073-4
024 7 _a10.1007/978-3-642-03073-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aMathematical Theory and Computational Practice
_h[electronic resource] :
_b5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009, Proceedings /
_cedited by Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXIV, 510 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5635
505 0 _aFirst-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.
520 _aThis book constitutes the proceedings of the 5th Conference on Computability in Europe, CiE 2009, held in Heidelberg, Germany, during July 19-24, 2009. The 34 papers presented together with 17 invited lectures were carefully reviewed and selected from 100 submissions. The aims of the conference is to advance our theoretical understanding of what can and cannot be computed, by any means of computation. It is the largest international meeting focused on computability theoretic issues.
650 0 _aComputer science.
_99832
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence.
_93407
650 0 _aBioinformatics.
_99561
650 1 4 _aTheory of Computation.
_9151157
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aAlgorithms.
_93390
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputational and Systems Biology.
_931619
700 1 _aAmbos-Spies, Klaus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151158
700 1 _aLöwe, Benedikt.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151159
700 1 _aMerkle, Wolfgang.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151160
710 2 _aSpringerLink (Online service)
_9151161
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642030727
776 0 8 _iPrinted edition:
_z9783642030741
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5635
_9151162
856 4 0 _uhttps://doi.org/10.1007/978-3-642-03073-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94415
_d94415