|
|
Re: Non-Euclidean Arithmetic
Posted:
Sep 18, 2012 12:04 PM
|
|
Paul Tanner II says:
>Repeated addition can compute products only if the products are computable - and since almost all real numbers are noncomputable, almost all real number multiplication is not computable.
Is it possible you are getting somewhere Paul?
That's exactly right. Neither you, nor Devlin, can multiply two real numbers in general. You can't use a "scaling process" to do so, nor can you do so through "repeated adamant insistance".
You can assert the product exists, but that's a different game.
Joe N
------- End of Forwarded Message
|
|
