“Logical” arithmetic on computers with two's complement binary arithmetic

DOI10.1145/363397.363562MaRDI QIDQ5545051zbMATH OpenOpenAlexFDO

Authors John R. Ehrman

Publication date 1968

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363397.363562

zbMATH Keywords

binary arithmeticfull-precision arithmeticmaximum significance arithmeticunsigned operand arithmetic

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Parallel algorithms in computer science (68W10)

Recommendations

• Correction to “logical” arithmetric on computers with two's complement binary arithmetic
• scientific article; zbMATH DE number 3749094
• Computer arithmetic algorithms.
• Computer arithmetic: Logic, calculation, and rewriting
• scientific article; zbMATH DE number 3974160

Cited in

(5)

• Computer arithmetic: Logic, calculation, and rewriting
• scientific article; zbMATH DE number 3749094 (Why is no real title available?)
• scientific article; zbMATH DE number 1543063 (Why is no real title available?)
• Two operand binary adders with threshold logic
• Correction to “logical” arithmetric on computers with two's complement binary arithmetic

This page was built for publication: “Logical” arithmetic on computers with two's complement binary arithmetic

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