Significance arithmetic: The carrying algorithm

DOI10.1016/0097-3165(73)90013-7zbMath0259.00001DBLPjournals/jct/MetropolisRT73OpenAlexW1994367948WikidataQ61782966 ScholiaQ61782966MaRDI QIDQ2560211

N. Metropolis, Gian-Carlo Rota, Stephen M. Tanny

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(73)90013-7

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Mathematics in general (00A05)

Related Items (6)

Computational complexity of iterated maps on the interval ⋮ A Boolean Analysis of Addition and Multiplication ⋮ The real numbers as a wreath product ⋮ Precise numerical computation ⋮ Significance arithmetic: The probability of carrying ⋮ A new set theory for analysis

Cites Work

• Algorithms in unnormalized arithmetic. I: Recurrence relations
• An axiomatic approach to rounded computations
• Introduction to the Role of Redundancy in Computer Arithmetic
• Numerical analysis as an independent science
• Higher-Radix Division Using Estimates of the Divisor and Partial Remainders
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Significance arithmetic: The carrying algorithm