|
|
|
|
| LEADER |
05948nmm a2200409 u 4500 |
| 001 |
EB000378893 |
| 003 |
EBX01000000000000000231945 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540730019
|
| 100 |
1 |
|
|a Cooper, Barry S.
|e [editor]
|
| 245 |
0 |
0 |
|a Computation and Logic in the Real World
|h Elektronische Ressource
|b Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings
|c edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi
|
| 250 |
|
|
|a 1st ed. 2007
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2007, 2007
|
| 300 |
|
|
|a XVIII, 826 p
|b online resource
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Bioinformatics
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Löwe, Benedikt
|e [editor]
|
| 700 |
1 |
|
|a Sorbi, Andrea
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-540-73001-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-73001-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|