Significance arithmetic: The carrying algorithm

DOI10.1016/0097-3165(73)90013-7MaRDI QIDQ2560211zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

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

Cites work

• Algorithms in unnormalized arithmetic. I: Recurrence relations
• An axiomatic approach to rounded computations
• Higher-Radix Division Using Estimates of the Divisor and Partial Remainders
• scientific article; zbMATH DE number 862514 (Why is no real title available?)
• scientific article; zbMATH DE number 3265643 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3322491 (Why is no real title available?)
• scientific article; zbMATH DE number 3381831 (Why is no real title available?)
• Introduction to the Role of Redundancy in Computer Arithmetic
• Numerical analysis as an independent science

Cited in

(6)

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

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

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