دانلود کتاب Programs, Proofs, Processes: 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 – July 4, 2010. Proceedings

فهرست مطالب :

Front Matter....Pages -
Avoiding Simplicity Is Complex....Pages 1-10
Higher-Order Containers....Pages 11-20
On the Completeness of Quantum Computation Models....Pages 21-30
The Ordinal of Skolem + Tetration Is τ 0 ....Pages 31-38
Proofs, Programs, Processes....Pages 39-48
Ergodic-Type Characterizations of Algorithmic Randomness....Pages 49-58
How Powerful Are Integer-Valued Martingales?....Pages 59-68
A Faster Algorithm for Finding Minimum Tucker Submatrices....Pages 69-77
Processes in Space....Pages 78-87
Computability of Countable Subshifts....Pages 88-97
The Limits of Tractability in Resolution-Based Propositional Proof Systems....Pages 98-107
Haskell before Haskell: Curry’s Contribution to Programming (1946–1950)....Pages 108-117
A Miniaturisation of Ramsey’s Theorem....Pages 118-125
Graph Structures and Algorithms for Query-Log Analysis....Pages 126-131
On the Complexity of Local Search for Weighted Standard Set Problems....Pages 132-140
Computational Interpretations of Analysis via Products of Selection Functions....Pages 141-150
The Peirce Translation and the Double Negation Shift....Pages 151-161
Counting the Changes of Random ${\\Delta^0_2}$ Sets....Pages 162-171
Boole: From Calculating Numbers to Calculating Thoughts....Pages 172-179
Approximability and Hardness in Multi-objective Optimization....Pages 180-189
${\\cal P}_w$ Is Not a Heyting Algebra....Pages 190-194
Lower Bounds for Reducibility to the Kolmogorov Random Strings....Pages 195-200
Spatial Models for Virtual Networks....Pages 201-210
DNA Rearrangements through Spatial Graphs....Pages 211-218
On Index Sets of Some Properties of Computable Algebras....Pages 219-228
The Strength of the Besicovitch-Davies Theorem....Pages 229-238
Circuit Complexity and Multiplicative Complexity of Boolean Functions....Pages 239-245
Definability in the Subword Order....Pages 246-255
Undecidability in Weihrauch Degrees....Pages 256-265
Degrees with Almost Universal Cupping Property....Pages 266-275
Incomputability in Physics....Pages 276-285
Approximate Self-assembly of the Sierpinski Triangle....Pages 286-295
Hairpin Lengthening....Pages 296-306
Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program....Pages 307-316
Computational Complexity Aspects in Membrane Computing....Pages 317-320
Computable Ordered Abelian Groups and Fields....Pages 321-330
Focusing in Asynchronous Games....Pages 331-341
A Note on the Least Informative Model of a Theory....Pages 342-351
Three Roots for Leibniz’s Contribution to the Computational Conception of Reason....Pages 352-361
Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo ....Pages 362-371
The Complexity of Explicit Constructions....Pages 372-375
Kolmogorov Complexity Cores....Pages 376-385
Every $\\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence....Pages 386-393
Computable Fields and Weak Truth-Table Reducibility....Pages 394-405
What Is the Problem with Proof Nets for Classical Logic?....Pages 406-416
Quasi-linear Dialectica Extraction....Pages 417-426
Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole....Pages 427-437
Inference Concerning Physical Systems....Pages 438-447
Back Matter....Pages -