Showing 2025Show all
2 papers · 1 filter
math.LO2025
Open Problems in Computability Theory and Descriptive Set Theory
George Barmpalias, Nikolay Bazhenov, Chi Tat Chong +11
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are…
math.LO2025
Online and feasible presentability: from trees to modal algebras
Nikolay Bazhenov, Dariusz Kalociński, Michał Wrocławski
We investigate whether every computable member of a given class of structures admits a fully primitive recursive (also known as punctual) or fully P-TIME copy. A class with this pr…