: This established that the language corresponding to the digits of
: The result focuses on the uniformity of the computation, meaning a single algorithm can produce the digits for any without needing pre-computed tables for different scales. Yap10 L 19
For further reading, the original manuscript is often archived as at NYU's Department of Computer Science. : This established that the language corresponding to
: Subsequent research building on Yap10 has shown that the first can be produced in TC0cap T cap C to the 0 power (a subclass of ) for any base Connection to Algebraic Numbers : While : Evaluating the exact complexity of specific bits
Recent papers (as late as 2022–2023) continue to cite Yap10 when discussing:
) , a complexity class representing problems that can be solved by a deterministic Turing machine using a memory space logarithmic to the size of the input.
: Evaluating the exact complexity of specific bits of transcendental and algebraic numbers.