Earlier quoted context omitted.
> A computer is always just a function from {0,1}^N -> {0,1}^M > The "Inf" interpretation, of, eg., 11111111111111111 isnt infinity. This is incoherent nonsense. If you want to say that the floating point value "infinity" isn't really infinity, you must also say that nothing else is really infinity either. That is true in a completely useless and uninformative sense, but it's false in every sense a person would ever…
I'm not sure where your misunderstanding comes from, but at least, you might consider you're disagreeing with an article on quanta magazine which writes up a project by experts in their field. In any case, no. The idea that a finite number of bits in a particular state "must just be infinity!!!! because the IEEE ref docs say so" is strange to say the least. The issue is to demonstrate that a given function, say f, fo…
Why would the output need to be not real? There's no difficulty with saying a real-valued function has a singularity.
The issue is to demonstrate that this function has a singularity at some point, yes. Simulation is a bad way to do that, though conceivably you could get lucky.
> A computer cannot demonstrate such a thing, because real-valued functions aren't computable.
Obviously false; computers are fully capable of providing proofs that some function has an infinite limit somewhere.
> The idea that a finite number of bits in a particular state "must just be infinity!!!! because the IEEE ref docs say so" is strange to say the least.
That is the only way anything is ever infinity - by designation. As I pointed out elsewhere, IEEE infinity has all the correct mathematical properties of positive infinity in the extended reals, so it's difficult to see what you think you're saying.
> I'm not sure where your misunderstanding comes from, but at least, you might consider you're disagreeing with an article on quanta magazine which writes up a project by experts in their field.
Writing about an expert doesn't make you any smarter. The reason proffered by Quanta is nonsense. They are correct that the experiment they describe cannot achieve the goal sought; they are quite obviously wrong about why.
> infinity isn't a bit pattern; and isn't here in any relevant sense even a number; the IEEE standard may as well have said "Overflow"
That's what infinity is. In every sense. Overflowing is defined by exceeding a boundary; infinity is defined by exceeding all boundaries.
I'm morbidly intrigued by your fetish for the idea of "bit patterns". Infinity is also not an image on paper. How do you expect a correct mathematical proof to represent infinity?