Pursuit of the Universal: 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings

Front Matter....Pages I-XV
Front Matter....Pages 1-1
Verifying Systems of Resource-Bounded Agents....Pages 3-12
Effective S-adic Symbolic Dynamical Systems....Pages 13-23
Reaction-Based Models of Biochemical Networks....Pages 24-34
Comparative Genomics on Artificial Life....Pages 35-44
Computability and Analysis, a Historical Approach....Pages 45-57
The Brouwer Fixed Point Theorem Revisited....Pages 58-67
Secret Sharing Schemes with Algebraic Properties and Applications....Pages 68-77
Squeezing Feasibility....Pages 78-88
Recent Advances in Non-perfect Secret Sharing Schemes....Pages 89-98
A Computational Approach to the Borwein-Ditor Theorem....Pages 99-104
Semantic Security and Key-Privacy with Random Split of St-Gen Codes....Pages 105-114
The Typical Constructible Object....Pages 115-123
Computability in Symbolic Dynamics....Pages 124-131
Using Semidirect Product of (Semi)groups in Public Key Cryptography....Pages 132-141
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis....Pages 142-152
Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond....Pages 153-163
Types in Programming Languages, Between Modelling, Abstraction, and Correctness....Pages 164-169
AFCAL and the Emergence of Computer Science in France: 1957–1967....Pages 170-181
Computable Reductions and Reverse Mathematics....Pages 182-191
Front Matter....Pages 193-193
Busy Beavers and Kolmogorov Complexity....Pages 195-204
Front Matter....Pages 193-193
The Domino Problem for Self-similar Structures....Pages 205-214
Axiomatizing Analog Algorithms....Pages 215-224
Generalized Effective Reducibility....Pages 225-233
Program Size Complexity of Correction Grammars in the Ershov Hierarchy....Pages 234-239
Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra....Pages 240-250
Parameterized Complexity and Approximation Issues for the Colorful Components Problems....Pages 251-260
A Candidate for the Generalised Real Line....Pages 261-270
Finitely Generated Semiautomatic Groups....Pages 271-281
The Boolean Algebra of Piecewise Testable Languages....Pages 282-291
On the Lattices of Effectively Open Sets....Pages 292-301
On the Executability of Interactive Computation....Pages 302-311
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic....Pages 312-322
The Complexity of Counting Quantifiers on Equality Languages....Pages 323-332
Partial Orders and Immunity in Reverse Mathematics....Pages 333-342
A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces....Pages 343-352
Back Matter....Pages 353-363
....Pages 364-374