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