2 citations · 2 across the 9 of their papers we have counts for
9 papers · 1 filter
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He +8
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Definability and Computation, June 22-26, 2026. The problems are organized into sect…
Speedability of computably approximable reals and their approximations
George Barmpalias, Nan Fang, Wolfgang Merkle +1
An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is…
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…
Collision-resistant hash-shuffles on the reals
George Barmpalias, Xiaoyan Zhang
Oneway real functions are effective maps on positive-measure sets of reals that preserve randomness and have no effective probabilistic inversions. We construct a oneway real funct…
Complexity of inversion of functions on the reals
George Barmpalias, Mingyang Wang, Xiaoyan Zhang
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
Dimensionality and randomness
George Barmpalias, Xiaoyan Zhang
Arranging the bits of a random string or real into k columns of a two-dimensional array or higher dimensional structure is typically accompanied with loss in the Kolmogorov complex…