News for hackers. Stuff that matters.

A comment on Abstract Algebra (2016) [pdf]. Parent comment

Re:Abstract Algebra (2016) [pdf] by AnimalMuppet on Friday March 10, 2017 @03:09PM (#13841676)
Integer arithmetic in hardware (and many languages) is a ring.

If I understand correctly, groups are the basis of some error correction codes.

Monads are used for many things in functional programming.

[ Parent | on HN ]
Re:Abstract Algebra (2016) [pdf] by umanwizard on Friday March 10, 2017 @10:27PM (#13844046)
Do you mean to say a finite ring? "Pure" integer arithmetic in math (without any notion of overflow or wrapping) is a ring also, so I'm not sure what distinction you're making by saying "in hardware".
[ Parent | on HN ]
Re:Abstract Algebra (2016) [pdf] by AnimalMuppet on Tuesday March 14, 2017 @11:56AM (#13868588)
Yes, a finite ring.

There are languages that overflow from hardware integers into some kind of BigNum automatically. Those languages are not finite rings. (Well, OK, they're finite in the sense that eventually the memory space will be exhausted...)

[ Parent | on HN ]
Re:Abstract Algebra (2016) [pdf] by umanwizard on Wednesday March 15, 2017 @04:34PM (#13879526)
yep, but they're still rings :)
[ Parent | on HN ]