Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1428.68037].
Indexed articles:
Bazhenov, Nikolay; Vatev, Stefan, A note on computable embeddings for ordinals and their reverses, 1-13 [Zbl 07633492]
Carl, Merlin, Clockability for ordinal Turing machines, 14-25 [Zbl 07633493]
de Brecht, Matthew, Some notes on spaces of ideals and computable topology, 26-37 [Zbl 07633494]
Fujiwara, Makoto, Parallelizations in Weihrauch reducibility and constructive reverse mathematics, 38-49 [Zbl 07633495]
Jakobsen, Sune Kristian; Simonsen, Jakob Grue, Liouville numbers and the computational complexity of changing bases, 50-62 [Zbl 07633496]
Kristiansen, Lars; Murwanashyaka, Juvenal, On interpretability between some weak essentially undecidable theories, 63-74 [Zbl 07633497]
Kristiansen, Lars; Simonsen, Jakob Grue, On the complexity of conversion between classic real number representations, 75-86 [Zbl 07633498]
Kutrib, Martin; Malcher, Andreas; Mereghetti, Carlo; Palano, Beatrice, Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power, 87-99 [Zbl 1540.68121]
Downey, Rodney G.; Melnikov, Alexander G., Computable analysis and classification problems, 100-111 [Zbl 07633500]
Miller, Russell, Non-coding enumeration operators, 112-123 [Zbl 07633501]
Zeugmann, Thomas, On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings, 124-136 [Zbl 07633502]
Berger, Ulrich; Petrovska, Olga; Tsuiki, Hideki, Prawf: an interactive proof system for program extraction, 137-148 [Zbl 07633503]
Bodirsky, Manuel; Knäuer, Simon; Starke, Florian, ASNP: a tame fragment of existential second-order logic, 149-162 [Zbl 07633504]
Fernández-Duque, David; Weiermann, Andreas, Ackermannian Goodstein sequences of intermediate growth, 163-174 [Zbl 07633505]
Haniková, Zuzana, On the complexity of validity degrees in Łukasiewicz logic, 175-188 [Zbl 07633506]
Hoyrup, Mathieu; Kihara, Takayuki; Selivanov, Victor, Degrees of non-computability of homeomorphism types of Polish spaces, 189-192 [Zbl 07633507]
Le Roux, Stéphane, Time-aware uniformization of winning strategies, 193-204 [Zbl 07633508]
Lim, Donghyun; Ziegler, Martin, Quantitative coding and complexity theory of compact metric spaces, 205-214 [Zbl 07633509]
Petrakis, Iosif, Functions of Baire class one over a Bishop topology, 215-227 [Zbl 07633510]
Frosini, A.; Palma, G.; Rinaldi, S., Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays, 228-238 [Zbl 1527.05129]
Schuster, Peter; Wessel, Daniel, The computational significance of Hausdorff’s maximal chain principle, 239-250 [Zbl 07633512]
Banderier, Cyril; Goldwurm, Massimiliano, Number of prefixes in trace monoids: clique polynomials and dependency graphs, 251-263 [Zbl 07633513]
Boccuto, Antonio; Carpi, Arturo, Repetitions in Toeplitz words and the Thue threshold, 264-276 [Zbl 07633514]
Bridoux, Florian; Gadouleau, Maximilien; Theyssier, Guillaume, On simulation in automata networks, 277-288 [Zbl 1530.68142]
Konstantinidis, Stavros, Theoretical and implementational aspects of the formal language server (LaSer), 289-295 [Zbl 07633516]
Lohrey, Markus, Balancing straight-line programs for strings and trees, 296-300 [Zbl 07633517]
Madonia, Maria, Two-dimensional codes, 301-305 [Zbl 07633518]
Martens, Wim, Formal languages in information extraction and graph databases, 306-309 [Zbl 07633519]
Moran, Shay; Nachum, Ido; Panasoff, Itai; Yehudayoff, Amir, On the perceptron’s compression, 310-325 [Zbl 07633520]
Perrot, Kévin; Sené, Sylvain; Venturini, Lucas, #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method, 326-338 [Zbl 07633521]
Prezza, Nicola; Rosone, Giovanna, Faster online computation of the succinct longest previous factor array, 339-352 [Zbl 07633522]
Uznański, Przemysław, Recent advances in text-to-pattern distance algorithms, 353-365 [Zbl 07633523]
Vu, Martin; Fernau, Henning, Insertion-deletion systems with substitutions. I, 366-378 [Zbl 1530.68138]