Computability theory. Abstracts from the workshop held January 7--13, 2018
From MaRDI portal
Publication:1731969
DOI10.4171/OWR/2018/1zbMath1409.00073MaRDI QIDQ1731969
No author found.
Publication date: 15 March 2019
Published in: Oberwolfach Reports (Search for Journal in Brave)
Proceedings of conferences of miscellaneous specific interest (00B25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Computable structure theory, computable model theory (03C57) Computability and recursion theory (03Dxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to build a probability-free casino
- Algorithmically finite groups.
- Sequences, discrepancies and applications
- How powerful are integer-valued martingales?
- On effective Birkhoff's ergodic theorem for computable actions of amenable groups
- Correspondence principles for effective dimensions
- How to gamble against all odds
- The Shannon-McMillan-Breiman theorem for a class of amenable groups
- Algebraic specifications of computable and semicomputable data types
- The d.r.e. degrees are not dense
- Ergodic theorems for individual random sequences
- Pointwise theorems for amenable groups.
- Degree spectra and computable dimensions in algebraic structures
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Finite-state dimension
- The dimensions of individual strings and sequences
- Finitely presented expansions of computably enumerable semigroups
- Effectiveness for the dual Ramsey theorem
- Bounding the dimension of points on a line
- Characterizing the continuous degrees
- Symbolic dynamics: entropy = dimension = complexity
- The dimension of ergodic random sequences
- Algorithmic Identification of Probabilities Is Hard
- The Vitali Covering Theorem in the Weihrauch Lattice
- Algorithmic Randomness and Complexity
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- Reflecting on incompleteness
- Inductive inference and unsolvability
- Resource-bounded balanced genericity, stochasticity and weak randomness
- A quest for algorithmically random infinite structures
- Computable Følner monotilings and a theorem of Brudno
- Isomorphism and classification for countable structures
- Computable metrization
- Degrees of unsolvability of continuous functions
- Strong jump-traceability and Demuth randomness
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Inherent enumerability of strong jump-traceability
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
- The Meta-R.E. sets, but not the Π11 sets, can be enumerated without repetition
- New Computational Paradigms
- Defining totality in the enumeration degrees
- Point Degree Spectra of Represented Spaces
This page was built for publication: Computability theory. Abstracts from the workshop held January 7--13, 2018
