Publication:4002815
From MaRDI portal
zbMath0751.01017MaRDI QIDQ4002815
Publication date: 18 September 1992
01A75: Collected or selected works; reprintings or translations of classics
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
11M26: Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses
03D40: Word problems, etc. in computability and recursion theory
03D10: Turing machines and related notions
11Y35: Analytic computations
Related Items
An example of a computable absolutely normal number, A polynomial-time algorithm for computing absolutely normal numbers, How ordinary elimination became Gaussian elimination, Large alphabets and incompressibility, Turing's unpublished algorithm for normal numbers, Multidisciplinary Trends in Modern Artificial Intelligence: Turing’s Way
