Informal Presentations

Here you can find the abstracts of all informal presentations: Download (ZIP)

Seyyed Alireza Ahmadi. Recurrent Subgroups of Topological Groups Abstract (PDF)
Satoru Kuroda. On Boolean valued models of Bounded Arithmetic Abstract (PDF)
Gualtiero Piccinini and Neal Anderson. Ontic Pancomputationalism (Informal Presentation) Abstract (PDF)
Stepan Holub. Formalization of Combinatorics on Words in Isabelle/HOL Abstract (PDF)
Yong Cheng. Two questions about incompleteness Abstract (PDF)
Florian Steinberg, Arno Pauly and Christine Gassner. Comparing integrability and measurability in different models of computation Abstract (PDF)
Dongseong Seon. Computability of Haar Averages Abstract (PDF)
Marta Fiori Carones. The reverse mathematics of a theorem about subgraphs with nice properties Abstract (PDF)
Nikolay Bazhenov, Manat Mustafa and Mars Yamaleev. On dark Σ02-equivalence relations Abstract (PDF)
Valentina Harizanov. Effective powers of countable structures Abstract (PDF)
Attila Bagossy and Peter Battyanyi. An encoding of the lambda-calculus into the calculus of String MultiSet Rewriting Abstract (PDF)
Chansu Park, Sewon Park and Martin Ziegler. On Tensor Calculus in Exact Real Computation: A Case Study from Recursive Analysis to Abstract Data Types Abstract (PDF)
Erzsébet Csuhaj-Varjú, Kristóf Kántor and György Vaszil. Languages of P Colony Automata Abstract (PDF)
Éric Goubault, Jérémy Ledent and Sergio Rajsbaum. A dynamic epistemic logic semantics for fault-tolerant distributed task computability Abstract (PDF)
Luca San Mauro, Ekaterina Fokina and Dino Rossegger. Measuring the complexity of reductions between equivalence relations Abstract (PDF)
Elvira Mayordomo. A point-to-set principle for separable metric spaces Abstract (PDF)
Karoliina Lehtinen. Solving parity games in quasi-polynomial time - a logician’s approach Abstract (PDF)
Michał Tomasz Godziszewski. Π01-computable quotient presentation of a nonstandard model of arithmetic Abstract (PDF)
Joel Day, Vijay Ganesh, Paul He, Florin Manea and Dirk Nowotka. The Satisfiability of Word Equations: Decidable and Undecidable Theories Abstract (PDF)
Franz Brauße, Margarita Korovina and Norbert Th. Müller. Improving Approximations by Taylor Models in Computable Analysis Abstract (PDF)
Keith Weber. Generalization of Infinite Time Turing Machines Abstract (PDF)