Regular submissions
Nikolay Bazhenov. Turing computable embeddings, computable infinitary equivalence, and linear orders
Zenon Sadowski. Total nondeterministic Turing machines and a p-optimal proof system for SAT
Nikolay Bazhenov and Mars Yamaleev. Degrees of Categoricity of Rigid Structures
Iosif Petrakis. McShane-Whitney pairs
Stefan Arnold and Jacobo Toran. A Deterministic Algorithm for Testing the Equivalence of Read-once Branching Programs with Small Discrepancy
Petr Golovach, Matthew Johnson, Barnaby Martin, Daniel Paulusma and Anthony Stewart. Surjective H-Colouring: New Hardness Results
Karoliina Lehtinen and Sandra Quickert. $\Sigma^{\mu}_2$ is decidable for $\Pi^{\mu}_2$
Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza and Mathieu Raffinot. Flexible Indexing of Repetitive Collections
Merlin Carl and Philipp Schlicht. The recognizability strength of infinite time Turing machines with ordinal parameters
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore and Konrad Zdanowski. New bounds on the strength of some restrictions of Hindman’s Theorem
Victor Selivanov. Extending Wadge Theory to k-Partitions
Ville Salo and Ilkka Törmä. A One-Dimensional Physically Universal Cellular Automaton
Margarita Korovina and Oleg Kudinov. On Higher Effective Descriptive Set Theory
Robert Barish and Akira Suyama. Counting Substrate Cycles in Topologically Restricted Metabolic Networks
Merlin Carl, Benedikt Löwe and Benjamin Rin. Koepke machines and satisfiability for infinitary propositional languages
Hugo Nobrega and Arno Pauly. Game characterizations and lower cones in the Weihrauch degrees (Extended Abstract)
Lorenzo Galeotti and Hugo Nobrega. Towards computable analysis on the generalised real line
Thierry Monteil. A universal oracle for signal machines
Gleb Novikov. Randomness deficiencies
Merlin Carl, Bruno Durand, Gregory Lafitte and Sabrina Ouazzani. Admissibles in gaps
Martin Delacourt and Nicolas Ollinger. Permutive one-way cellular automata and the finiteness problem for automaton groups
Oscar Defrain, Bruno Durand and Gregory Lafitte. Infinite time busy beavers
Neil Lutz and Donald Stull. Dimension Spectra of Lines
Daniela Genova and Hendrik Jan Hoogeboom. Finite Language Forbidding-Enforcing Systems
Informal presentations
Ethan McCarthy. Cototal enumeration degrees and the Turing degree spectra of minimal subshifts
Claus Brillowski. A Demonstration of Continuous Name-Binding and Global Information Storage
Vasco Brattka, Rupert Hölzl and Rutger Kuyper. Monte Carlo Computability
Chansu Park, Ji-Won Park, Sewon Park, Dongseong Seon and Martin Ziegler. Computable Operations on Compact Subsets of Metric Spaces with Applications to Frechet Distance and Shape Optimization
Victor Selivanov and Mars Yamaleev. Extending a Cooper’s Theorem to $\Delta^0_3$ Turing degrees
Pavel Semukhin and Igor Potapov. Membership Problem for 2×2 nonsingilar integer matrices
Patrick Sibelius. The Axiom of Choice and Peano Arithmetic do not match
Manon Stipulanti. Generalized Pascal triangles for binomial coefficients of finite words
Alexandra Soskova. Structural properties of spectra and $\omega$-spectra
Akitoshi Kawamura, Holger Thies and Martin Ziegler. Average case complexity for the N-body problem
Joseph Almog and Vesa Halava. Turing completeness, FOL completeness and definability
Richard Whyman. On the Computation and Complexity of Arbitrary Physical Computers
Erzsébet Csuhaj-Varjú and György Vaszil. Stability Languages of Networks of Watson-Crick D0L Systems
Shilpa Garg and Tobias Moemke. A PTAS for Gapless MEC
Luca San Mauro, Ekaterina Fokina and Dino Rossegger. Bi-embeddability spectra of structures
Kentaro Sato. A study on complexity of winning strategy
Vladimir Aristov and Andrey Stroganov. Method of computer analogy: analytics and approximations
Karoliina Lehtinen. Parity games and the modal mu alternation hierarchy
Elvira Mayordomo. Effective exact Hausdorff dimension in general metric spaces