CiE C

46 papers

YearTitle / Authors
2021A Church-Turing Thesis for Randomness?
Johanna N. Y. Franklin
2021A Tale of Optimizing the Space Taken by de Bruijn Graphs.
Rayan Chikhi
2021An Algorithmic Version of Zariski's Lemma.
Franziskus Wiesnet
2021Complexity and Categoricity of Injection Structures Induced by Finite State Transducers.
Richard Krogman, Douglas Cenzer
2021Compression Techniques in Group Theory.
Markus Lohrey
2021Computability of Limit Sets for Two-Dimensional Flows.
Daniel Silva Graça, Ning Zhong
2021Computable Procedures for Fields.
Russell Miller
2021Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings
Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque
2021Constructive Mathematics, Church's Thesis, and Free Choice Sequences.
D. A. Turner
2021Dedekind Cuts and Long Strings of Zeros in Base Expansions.
Ivan Georgiev
2021Defining Formal Explanation in Classical Logic by Substructural Derivability.
Francesco A. Genco, Francesca Poggiolesi
2021Effective Inseparability and Its Applications.
Andrea Sorbi
2021Einstein Meets Turing: The Computability of Nonlocal Games.
Henry Yuen
2021Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry.
Karl Bringmann
2021Formally Computing with the Non-computable.
Liron Cohen
2021In Search of the First-Order Part of Ramsey's Theorem for Pairs.
Leszek Aleksander Kolodziejczyk, Keita Yokoyama
2021Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori.
Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki
2021KL-Randomness and Effective Dimension Under Strong Reducibility.
Bjørn Kjos-Hanssen, David J. Webb
2021Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes.
Timo Kötzing, Karen Seidel
2021Learning Languages with Decidable Hypotheses.
Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger
2021Limitwise Monotonic Spectra and Their Generalizations.
Marat Kh. Faizrahmanov
2021Mapping Monotonic Restrictions in Inductive Inference.
Vanja Doskoc, Timo Kötzing
2021Minimum Classical Extensions of Constructive Theories.
Joan Rand Moschovakis, Garyfallia Vafeiadou
2021Non-collapse of the Effective Wadge Hierarchy.
Victor L. Selivanov
2021Normal Forms for Semantically Witness-Based Learners in Inductive Inference.
Vanja Doskoc, Timo Kötzing
2021On 3SUM-hard Problems in the Decision Tree Model.
Esther Ezra
2021On False Heine/Borel Compactness Principles in Proof Mining.
Fernando Ferreira
2021On Measure Quantifiers in First-Order Arithmetic.
Melissa Antonelli, Ugo Dal Lago, Paolo Pistone
2021On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising Strategy.
Angeliki Koutsoukou-Argyraki
2021On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences.
Lars Kristiansen
2021On the Degrees of Constructively Immune Sets.
Samuel D. Birns, Bjørn Kjos-Hanssen
2021On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics.
Eric Goles, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier
2021Placing Green Bridges Optimally, with a Multivariate Analysis.
Till Fluschnik, Leon Kellerhals
2021Positive Enumerable Functors.
Barbara F. Csima, Dino Rossegger, Daniel Yu
2021Probabilistic Models of k-mer Frequencies (Extended Abstract).
Askar Gafurov, Tomás Vinar, Brona Brejová
2021Péter on Church's Thesis, Constructivity and Computers.
Máté Szabó
2021Randomising Realizability.
Merlin Carl, Lorenzo Galeotti, Robert Paßmann
2021Restrictions of Hindman's Theorem: An Overview.
Lorenzo Carlucci
2021Robust Online Algorithms for Dynamic Choosing Problems.
Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche
2021Searching for Applicable Versions of Computable Structures.
Pavel Alaev, Victor L. Selivanov
2021Simple Betting and Stochasticity.
Tomasz Steifer
2021Splittings and Robustness for the Heine-Borel Theorem.
Sam Sanders
2021Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations.
Jean-Yves Moyen, Jakob Grue Simonsen
2021The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines.
Merlin Carl
2021Towards a Map for Incremental Learning in the Limit from Positive and Negative Information.
Ardalan Khazraei, Timo Kötzing, Karen Seidel
2021Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBlunted.
Jordan M. Eizenga, Ryan Lorig-Roach, Melissa M. Meredith, Benedict Paten