scientific article
From MaRDI portal
Publication:4002815
zbMath0751.01017MaRDI QIDQ4002815
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collected or selected works; reprintings or translations of classics (01A75) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Word problems, etc. in computability and recursion theory (03D40) Turing machines and related notions (03D10) Analytic computations (11Y35)
Related Items (14)
Large alphabets and incompressibility ⋮ Computable absolutely Pisot normal numbers ⋮ A polynomial-time algorithm for computing absolutely normal numbers ⋮ Turing's unpublished algorithm for normal numbers ⋮ The secret life of I. J. Good ⋮ Finite-state independence and normal sequences ⋮ Normal Numbers and Computer Science ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ How ordinary elimination became Gaussian elimination ⋮ An example of a computable absolutely normal number ⋮ After 1952: the later development of Alan Turing's ideas on the mathematics of pattern formation ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Multidisciplinary Trends in Modern Artificial Intelligence: Turing’s Way ⋮ M. Levin’s construction of absolutely normal numbers with very low discrepancy
This page was built for publication:
