| Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics
|
2020 |
Fujiwara, Makoto |
| On Interpretability Between Some Weak Essentially Undecidable Theories
|
2020 |
Kristiansen, Lars |
| Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power
|
2020 |
Kutrib, Martin |
| Ackermannian Goodstein Sequences of Intermediate Growth
|
2020 |
Fernández-Duque, David |
| ASNP: A Tame Fragment of Existential Second-Order Logic
|
2020 |
Bodirsky, Manuel |
| Theoretical and Implementational Aspects of the Formal Language Server (LaSer)
|
2020 |
Konstantinidis, Stavros |
| Two-Dimensional Codes
|
2020 |
Madonia, Maria |
| A Note on Computable Embeddings for Ordinals and Their Reverses
|
2020 |
Bazhenov, Nikolay |
| Clockability for Ordinal Turing Machines
|
2020 |
Carl, Merlin |
| Some Notes on Spaces of Ideals and Computable Topology
|
2020 |
Brecht, Matthew de |
| Liouville Numbers and the Computational Complexity of Changing Bases
|
2020 |
Jakobsen, Sune Kristian |
| Computable Analysis and Classification Problems
|
2020 |
Downey, Rodney G. |
| Non-coding Enumeration Operators
|
2020 |
Miller, Russell |
| On the Complexity of Validity Degrees in Lukasiewicz Logic
|
2020 |
Haniková, Zuzana |
| Degrees of Non-computability of Homeomorphism Types of Polish Spaces
|
2020 |
Hoyrup, Mathieu |
| Time-Aware Uniformization of Winning Strategies
|
2020 |
Roux, Stephane Le |
| On Simulation in Automata Networks
|
2020 |
Bridoux, Florian |
| Recent Advances in Text-to-Pattern Distance Algorithms
|
2020 |
Uznanski, Przemystaw |
| On the Complexity of Conversion Between Classic Real Number Representations
|
2020 |
Kristiansen, Lars |
| On the Interplay Between Inductive Inference of Recursive Functions Complexity Theory and Recursive Numberings
|
2020 |
Zeugmann, Thomas |
Tag hinzufügen