• DocumentCode
    3344375
  • Title

    Groupoids and computer arithmetic

  • Author

    Garner, Harvey L. ; Foo, Norman ; Hsieh, Lo

  • Author_Institution
    Univ. of Pennsylvania, Philadelphia, PA, USA
  • fYear
    1972
  • fDate
    15-16 May 1972
  • Firstpage
    1
  • Lastpage
    14
  • Abstract
    Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X1 <; X1, fx). In particular, if f is associative and commutative, overflow recovery is obtainable even if fx is neither associative or commutative.
  • Keywords
    digital arithmetic; number theory; computer arithmetic; groupoids arithmetic; overflow detection; overflow recovery; Educational institutions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic (ARITH), 1972 IEEE 2nd Symposium on
  • Conference_Location
    New York, NY
  • Type

    conf

  • DOI
    10.1109/ARITH.1972.6153886
  • Filename
    6153886
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3344375