CiE C

38 papers

YearTitle / Authors
2016A Candidate for the Generalised Real Line.
Lorenzo Galeotti
2016A Computational Approach to the Borwein-Ditor Theorem.
Aleksander Galicki, André Nies
2016A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces.
Iosif Petrakis
2016AFCAL and the Emergence of Computer Science in France: 1957-1967.
Pierre-Éric Mounier-Kuhn, Maël Pégny
2016Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra.
Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov
2016Axiomatizing Analog Algorithms.
Olivier Bournez, Nachum Dershowitz, Pierre Néron
2016Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q Q.
Russell Miller
2016Busy Beavers and Kolmogorov Complexity.
Mikhail Andreev
2016Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic.
Christian Glaßer, Peter Jonsson, Barnaby Martin
2016Comparative Genomics on Artificial Life.
Priscila Biller, Carole Knibbe, Guillaume Beslon, Eric Tannier
2016Computability and Analysis, a Historical Approach.
Vasco Brattka
2016Computability in Symbolic Dynamics.
Emmanuel Jeandel
2016Computable Reductions and Reverse Mathematics.
Reed Solomon
2016Effective S-adic Symbolic Dynamical Systems.
Valérie Berthé, Thomas Fernique, Mathieu Sablik
2016Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond.
Irène Marcovici
2016Finitely Generated Semiautomatic Groups.
Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan
2016Generalized Effective Reducibility.
Merlin Carl
2016Lightface Π
Gemma Carotenuto, André Nies
2016On the Executability of Interactive Computation.
Bas Luttik, Fei Yang
2016On the Lattices of Effectively Open Sets.
Oleg V. Kudinov, Victor L. Selivanov
2016Parameterized Complexity and Approximation Issues for the Colorful Components Problems.
Riccardo Dondi, Florian Sikora
2016Partial Orders and Immunity in Reverse Mathematics.
Ludovic Patey
2016Program Size Complexity of Correction Grammars in the Ershov Hierarchy.
John Case, James S. Royer
2016Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings
Arnold Beckmann, Laurent Bienvenu, Natasa Jonoska
2016Reaction-Based Models of Biochemical Networks.
Daniela Besozzi
2016Recent Advances in Non-perfect Secret Sharing Schemes.
Oriol Farràs
2016Secret Sharing Schemes with Algebraic Properties and Applications.
Ignacio Cascudo
2016Semantic Security and Key-Privacy with Random Split of St-Gen Codes.
Danilo Gligoroski, Simona Samardjiska
2016Squeezing Feasibility.
Walter Dean
2016The Boolean Algebra of Piecewise Testable Languages.
Anton Konovalov, Victor L. Selivanov
2016The Brouwer Fixed Point Theorem Revisited.
Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly
2016The Complexity of Counting Quantifiers on Equality Languages.
Barnaby Martin, András Pongrácz, Michal Wrona
2016The Domino Problem for Self-similar Structures.
Sebastián Barbieri, Mathieu Sablik
2016The Typical Constructible Object.
Mathieu Hoyrup
2016Towards Computational Complexity Theory on Advanced Function Spaces in Analysis.
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
2016Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract.
Simone Martini
2016Using Semidirect Product of (Semi)groups in Public Key Cryptography.
Delaram Kahrobaei, Vladimir Shpilrain
2016Verifying Systems of Resource-Bounded Agents.
Natasha Alechina, Brian Logan