Mathematics and computer science: coping with finiteness

DOI10.1126/SCIENCE.194.4271.1235zbMATH Open1225.68001OpenAlexW2082738784WikidataQ34006489 ScholiaQ34006489MaRDI QIDQ3096006FDOQ3096006

Authors: Donald E. Knuth 

Publication date: 5 November 2011

Published in: Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1126/science.194.4271.1235

Recommendations

• Infinity and Finite Arithmetic
• scientific article; zbMATH DE number 1458676
• scientific article; zbMATH DE number 4011937
• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
• Will the digital computer transform classical mathematics?

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Cited In (33)

• Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns
• Enhancement of coping through blurring
• Spectra and satisfiability for logics with successor and a unary function
• Title not available (Why is that?)
• Title not available (Why is that?)
• Four bugs on a rectangle
• Functorial Fast-Growing Hierarchies
• Sequential importance sampling for estimating the number of perfect matchings in bipartite graphs: an ongoing conversation with Laci
• A new approach to the \(Z\)-transform through infinite computation
• Homology of groups and third busy beaver function
• Computers as a novel mathematical reality. I: A personal account
• Backtracking with multi-level dynamic search rearrangement
• Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
• On interior branch points of minimal surfaces
• A sequential algorithm for generating random graphs
• Binary trees as a computational framework
• Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
• On the importance sampling of self-avoiding walks
• Title not available (Why is that?)
• On interior branch points of minimal surfaces
• Beyond Knuth's notation for unimaginable numbers within computational number theory
• A fast-growing sequence inspired by \(\mathrm{TREE}(k)\)
• On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
• Robust importance sampling with adaptive winsorization
• Exact solution of weighted partially directed walks crossing a square
• Linear syzygies, hyperbolic Coxeter groups and regularity
• Modular arithmetic of iterated powers
• Minimum energy requirements of information transfer and computing
• On the convergence of infinite towers of powers and logarithms for general initial data: applications to Lambert W function sequences
• Knuth's iterated powers
• Critical scaling of lattice polymers confined to a box without endpoint restriction
• Reduced word enumeration, complexity, and randomization
• The sample size required in importance sampling

This page was built for publication: Mathematics and computer science: coping with finiteness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096006)