2 citations · 5 across the 11 of their papers we have counts for
13 papers
The descriptive complexity of the set of Poisson generic numbers
Verónica Becher, Stephen Jackson, Dominik Kwietniak +1
Let be an integer. We show that the set of real numbers that are Poisson generic in base is -complete in the Borel hierarchy of subsets of the real l…
Complexity and Ramsey Largeness of Sets of Oracles Separating Complexity Classes
Alex Creiner, Stephen Jackson
We prove two sets of results concerning computational complexity classes. The first concerns a variation of the random oracle hypothesis posed by Bennett and Gill after they showed…
The no- McMullen game and the perfect set property
Logan Crone, Lior Fishman, Stephen Jackson
Given a target set and a real number , McMullen introduced the notion of being an absolutely -winning set. This involves a two player g…
On the existence of numbers with matching continued fraction and decimal expansions
Pieter Allaart, Stephen Jackson, Taylor Jones +1
A Trott number is a number whose continued fraction expansion is equal to its base expansion for a given base , in the following sense: If ,…
A non-Borel special alpha-limit set in the square
Steve Jackson, Bill Mance, Samuel Roth
We consider the complexity of special -limit sets, a kind of backward limit set for non-invertible dynamical systems. We show that these sets are always analytic, but not necess…
Hausdorff Dimension Regularity Properties and Games
Logan Crone, Lior Fishman, Stephen Jackson
The Hausdorff -dimension game was introduced by Das, Fishman, Simmons and {Urba{ń}ski} and shown to characterize sets in having Hausdorff dimension . We i…