Abstract is missing.
- Verifying Systems of Resource-Bounded AgentsNatasha Alechina, Brian Logan. 3-12 [doi]
- Effective S-adic Symbolic Dynamical SystemsValérie Berthé, Thomas Fernique, Mathieu Sablik. 13-23 [doi]
- Reaction-Based Models of Biochemical NetworksDaniela Besozzi. 24-34 [doi]
- Comparative Genomics on Artificial LifePriscila Biller, Carole Knibbe, Guillaume Beslon, Eric Tannier. 35-44 [doi]
- Computability and Analysis, a Historical ApproachVasco Brattka. 45-57 [doi]
- The Brouwer Fixed Point Theorem RevisitedVasco Brattka, Stéphane Le Roux 0001, Joseph S. Miller, Arno Pauly. 58-67 [doi]
- Secret Sharing Schemes with Algebraic Properties and ApplicationsIgnacio Cascudo. 68-77 [doi]
- Squeezing FeasibilityWalter Dean. 78-88 [doi]
- Recent Advances in Non-perfect Secret Sharing SchemesOriol Farràs. 89-98 [doi]
- A Computational Approach to the Borwein-Ditor TheoremAleksander Galicki, André Nies. 99-104 [doi]
- Semantic Security and Key-Privacy with Random Split of St-Gen CodesDanilo Gligoroski, Simona Samardjiska. 105-114 [doi]
- The Typical Constructible ObjectMathieu Hoyrup. 115-123 [doi]
- Computability in Symbolic DynamicsEmmanuel Jeandel. 124-131 [doi]
- Using Semidirect Product of (Semi)groups in Public Key CryptographyDelaram Kahrobaei, Vladimir Shpilrain. 132-141 [doi]
- Towards Computational Complexity Theory on Advanced Function Spaces in AnalysisAkitoshi Kawamura, Florian Steinberg, Martin Ziegler 0001. 142-152 [doi]
- Ergodicity of Noisy Cellular Automata: The Coupling Method and BeyondIrene Marcovici. 153-163 [doi]
- Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended AbstractSimone Martini. 164-169 [doi]
- AFCAL and the Emergence of Computer Science in France: 1957-1967Pierre-Éric Mounier-Kuhn, Maël Pégny. 170-181 [doi]
- Computable Reductions and Reverse MathematicsReed Solomon. 182-191 [doi]
- Busy Beavers and Kolmogorov ComplexityMikhail Andreev. 195-204 [doi]
- The Domino Problem for Self-similar StructuresSebastián Barbieri, Mathieu Sablik. 205-214 [doi]
- Axiomatizing Analog AlgorithmsOlivier Bournez, Nachum Dershowitz, Pierre Néron. 215-224 [doi]
- Generalized Effective ReducibilityMerlin Carl. 225-233 [doi]
- 0-Completeness of Density Sets Under Effective Wadge ReducibilityGemma Carotenuto, André Nies. 234-239 [doi]
- Program Size Complexity of Correction Grammars in the Ershov HierarchyJohn Case, James S. Royer. 240-250 [doi]
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable AlgebraRumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov. 251-260 [doi]
- Parameterized Complexity and Approximation Issues for the Colorful Components ProblemsRiccardo Dondi, Florian Sikora. 261-270 [doi]
- A Candidate for the Generalised Real LineLorenzo Galeotti. 271-281 [doi]
- Finitely Generated Semiautomatic GroupsSanjay Jain, Bakhadyr Khoussainov, Frank Stephan. 282-291 [doi]
- The Boolean Algebra of Piecewise Testable LanguagesAnton Konovalov, Victor L. Selivanov. 292-301 [doi]
- On the Lattices of Effectively Open SetsOleg V. Kudinov, Victor L. Selivanov. 302-311 [doi]
- On the Executability of Interactive ComputationBas Luttik, Fei Yang. 312-322 [doi]
- Circuit Satisfiability and Constraint Satisfaction Around Skolem ArithmeticChristian Glaßer, Peter Jonsson, Barnaby Martin. 323-332 [doi]
- The Complexity of Counting Quantifiers on Equality LanguagesBarnaby Martin, András Pongrácz, Michal Wrona. 333-342 [doi]
- Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q QRussell Miller. 343-352 [doi]
- Partial Orders and Immunity in Reverse MathematicsLudovic Patey. 353-363 [doi]
- A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric SpacesIosif Petrakis. 364-374 [doi]