Complexity profiles and generic Muchnik reducibility
From MaRDI portal
Publication:6182774
DOI10.1016/j.aim.2023.109397MaRDI QIDQ6182774
Joseph S. Miller, Mariya Ivanova Soskova, Uri Andrews, Noah Schweber
Publication date: 21 December 2023
Published in: Advances in Mathematics (Search for Journal in Brave)
03D30: Other degrees and reducibilities in computability and recursion theory
03C57: Computable structure theory, computable model theory
03E40: Other aspects of forcing and Boolean-valued models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generic Muchnik reducibility and presentations of fields
- Generic copies of countable structures
- Computability on computable metric spaces
- COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
- COMPARING TWO VERSIONS OF THE REALS
- Degrees coded in jumps of orderings
- COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS
- Effective model theory vs. recursive model theory
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER