Indeed, they're not. The process of basically continuing indefinitely is not a valid algorithm in the limited system. What were you going to get for 2∕3? Actually, continuing indefinitely does not work in any practical system - you never complete the calculation! (This is one reason for working with representations as (numerator, denominator) for exact calculations.) To use decimals, one has to modify normal long division to recognise when the digit sequence will repeat. Of course, sometimes the sequence will be too long - the division is then not valid in the limited system.zompist wrote: ↑Sun Sep 06, 2026 3:37 pmYou're not getting Raphael's idea, which is to posit a highest number, set at one googleplex. If there is no infinity, there is no infinite recursion.
1/3 in the current system:
/-------- a googolplex of 3's -------\
.333333333333...33333333333333333333333333....
In the no-infinities system,1/3 is
/-------- a googolplex of 3's -------\
.333333333333...333333333333
These are not the same number.
For addition and subtraction of recurring decimals, one would face insuperable problems when lowest common multiples don't exist.
Yes, they can just fail. There is no requirement to be able to add any two numbers. For the obvious analogy, consider ordinary 32-bit addition without overflow. For many pairs (about 50% of positive integers), addition just fails.zompist wrote: ↑Sun Sep 06, 2026 3:37 pm It's true that Raphael's system would allow a finite number of rational numbers— you can still write and calculate with1/3 etc.
This still leads to problems. The smallest fraction is 1/googolplex of the [0,1] interval. But consider the number n which is 1 less than googolplex. What is 1/n? It's a division of the [0,1] interval but not the same division, and it's impossible to measure 1/n in terms of 1/googolplexes.
We could definite both in terms of 1 / (googolplex * n). But this is heresy in the no-infinity system, since you cannot have numbers above googolplex, and there is no fraction smaller than 1/googolplex.
Basically every mathematical operation fails at some point and has to be limited.
Exactly - not every pair of numbers has a product in the limited system. The elementary binary operations are all partial operations, just as division is with unlimited integers. Subtraction also has failures if working only with natural numbers.
An existing analogy is the set of ordinal numbers. Under the usual (ZF) set axioms, there's no such thing. At least, it's not a set. Possibly limiting integers should result in sets without cardinals. You missed a related but more basic issue - how many signed integers are there? (Conventionally, signed integers are the equivalence classes of pairs of natural numbers.) Even more basic - how many unsigned numbers are there? googolplex + 1 is not a valid answer!