The following pages link to (Q4002815):
Displayed 14 items.
- A polynomial-time algorithm for computing absolutely normal numbers (Q386000) (← links)
- How ordinary elimination became Gaussian elimination (Q716156) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- Turing's unpublished algorithm for normal numbers (Q884468) (← links)
- Finite-state independence and normal sequences (Q2424666) (← links)
- Multidisciplinary Trends in Modern Artificial Intelligence: Turing’s Way (Q2866115) (← links)
- Computable absolutely Pisot normal numbers (Q4581948) (← links)
- Normal Numbers and Computer Science (Q4613551) (← links)
- Conceptual Confluence in 1936: Post and Turing (Q4637215) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- M. Levin’s construction of absolutely normal numbers with very low discrepancy (Q5270840) (← links)
- An example of a computable absolutely normal number (Q5958342) (← links)
- After 1952: the later development of Alan Turing's ideas on the mathematics of pattern formation (Q5962965) (← links)
- The secret life of I. J. Good (Q6111473) (← links)