Yap10 L 19 Access

: 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.

: Evaluating the exact complexity of specific bits of transcendental and algebraic numbers. Yap10 L 19

: Yap demonstrated that there is a logspace-computable function that, given an input 1n1 to the n-th power , outputs the first : The result focuses on the uniformity of

: 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 ) , a complexity class representing problems that

For further reading, the original manuscript is often archived as at NYU's Department of Computer Science.

) , 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.