top | item 44416018 (no title) neepi | 8 months ago Proper integers aren’t bounded. Computer ints are. discuss order hn newest jrvieira|8 months ago Unbounded integer types exist, which have infinite precision in theory and are only limited by available memory in practice.You can make the argument that "proper" integers are also bounded in practice by limitations of our universe :) layer8|8 months ago Unbounded integer types aren't ints.The important point is that the arithmetic operators on int perform modulo arithmetics, not the normal arithmetics you would expect on unbounded integers. This is often not explained when first teaching ints. load replies (1)
jrvieira|8 months ago Unbounded integer types exist, which have infinite precision in theory and are only limited by available memory in practice.You can make the argument that "proper" integers are also bounded in practice by limitations of our universe :) layer8|8 months ago Unbounded integer types aren't ints.The important point is that the arithmetic operators on int perform modulo arithmetics, not the normal arithmetics you would expect on unbounded integers. This is often not explained when first teaching ints. load replies (1)
layer8|8 months ago Unbounded integer types aren't ints.The important point is that the arithmetic operators on int perform modulo arithmetics, not the normal arithmetics you would expect on unbounded integers. This is often not explained when first teaching ints. load replies (1)
jrvieira|8 months ago
You can make the argument that "proper" integers are also bounded in practice by limitations of our universe :)
layer8|8 months ago
The important point is that the arithmetic operators on int perform modulo arithmetics, not the normal arithmetics you would expect on unbounded integers. This is often not explained when first teaching ints.