If a student asked you to explain "what is a non-terminating process?" what would your reply be, and how would you avoid running into circularity? — sime
Look in virtually any introductory textbook or set of lecture notes on computability. And we don't need a notion of 'potential infinity' to explain the notion of non-termination. The classical treatment of computability is replete with the notion of non-halting. For example, it is a well known simple fact that a program to list the natural numbers does not halt.
Moreover, it is the responsibility of proponents of the notion of 'potential infinity' to provide the needed definitions to support the notion; not the responsibility of people who don't rely on the notion. The fact that you are mixed up about this subject shouldn't entail that you try to patch that up by supplying incorrect and incoherent claims and attribute them to Brouwer and the intuitionists. You continue to say that Brouwer and intuitionists understand potentially infinite sequences to be "eventually finitely bounded". Yet, after multiple requests, you fail to provide a source where Brouwer or anyone said that.
I cannot think of any way of explaining what is meant by a non-terminating process, other than to refer to it as a finite sequence whose length is unknown. — sime
Classically, it can be explained as not one finite sequence but as a sequence of finite sequences. Or, non-classically, to avoid having an infinite sequence of finite sequences, as anyone can read in virtually any article about 'potential infinity', even at the most basic level: For any finite sequence, there is a finite sequence of greater length, but there is not an upper bound to the lengths of such finite sequences. That is the OPPOSITE of saying that there is a finite bound on the lengths.
"non-terminating" processes do in fact eventually terminate/pause/stop/don't continue/etc. — sime
One can posit that no physical process continues without termination. But, as I've asked you again and again, please cite where Brouwer said that a potentially infinite sequence is "eventually finitely bounded". More generally, if you have no Brouwer source to point to, then you should not conflate your claim that an ideal process is not realized physically so a non-terminating process is "eventually finitely bounded" with Brouwer who, as far as we know, never advocated that a potentially infinite sequence is "eventually finitely bounded", especially as the notion of potential infinity is the OPPOSITE.
Where do you find "eventually finitely bounded" in Brouwer, or even any secondary source, on potential infinity? Please cite a specific passage.
— TonesInDeepFreeze
It is a logically equivalent interpretation of Brouwer's unfinishable choice sequences generated by a creating subject — sime
You use terminology in such a sloppy yet grandiose way:
(1) Logical equivalence is a special notion. You haven't shown any "logical equivalence".
(2) By mere fiat you declare a logical equivalence. Still, you do not cite anything Brouwer said that even suggests (let alone is "logically equivalent") to "eventually finitely bounded", especially as it is the OPPOSITE of the notion of potential infinity.
Martin[-]Lof's "The Mathematics of Infinity" — sime
I will look at it. I am not well versed in type theory and category theory.
Classical mathematics and Set theory conflate the notions of absolute with potential infinity, — sime
ZFC could not possibly conflate the notions since set theory doesn't even have a notion of 'potential infinity' nor does set theory mention 'absolute infinity'.
Again, 'absolute infinity' is a notion of Cantor that is not used in ZFC. You persist to use 'absolute infinity' in your own personal sense (for you, 'absolute infinity' is the notion that an intensional definition can specify a set that cannot be finitely listed), which is very different from Cantor's use of the term.
And even with your sense, though ZFC does define sets that are not finite, that is not "conflating" with some other notion ('potential infinity') that ZFC does not even address.
in computer science, where a rigorous concept of potential infinity becomes needed, and where ZFC is discarded as junk. — sime
A rigorous definition would be good for those who use the concept. But ZFC does not use it. And ZFC does provide a rigorous axiomatization for classical computer theory. If you want a rigorous non-classical computer theory, then it's your job to make it rigorous; your lack of doing that is not a fault of ZFC.
And I guess there are some people in computer science who regard ZFC as junk, but that is not at all any kind of consensus or, as far as I know, even a large contingent. You don't legitimately get to speak on behalf of "computer science".
Cantor does mean what i mean in so far that his position is embodied by the axioms of Zermelo set theory: — sime
Wow. You are so wrong, and so obviously so. A combination perhaps of ignorance and intellectual dishonesty.
The very purpose of Z is to not include axioms that would allow an absolute infinity. Why don't you get a book on introductory set theory and inform yourself on this subject?
The Law of Excluded Middle is not only invalid, but false with respect to intuitionism. — sime
Yes, LEM is not a logical validity in intuitionism. That doesn't contribute to claiming that Cantor's sense of 'absolute infinity' is the same as your own personal sense of it. (Also, there is a technical question about what 'false' in a semantic sense means for intuitionism. In finite domains, LEM is TRUE in intuitionism. Of course, we would have to look at specific intuitionistic set theories to see whether LEM is false in any given model.)
The axiom of regularity (added in ZFC) prevents the formulation of unfinishable sets required for potential infinity. — sime
I have no idea what you have in mind with the notion of the axiom of regularity "preventing unfinishable sets". ZFC has no predicate "unfinishable sets", so the axiom of regularity couldn't allow nor "prevent" anything about. It is incorrect to say that ZFC makes determinations on notions that are not even expressed in ZFC.
And the axiom of regularity doesn't contribute to a claim that what Cantor meant by 'absolute infinity' is what you mean by it.
For example, in {1,2,3 ... } where "..." refers to lazy evaluation, there is nothing wrong with substituting {1,2,3 ...} indefinitely for "..." — sime
I don't know what that is supposed to mean. But, to be clear "..." is not in the language of set theory, not even as extended by definition, but rather it is informal notation that can be eliminated with actually rigorous notation.
no honest mathematician knows what is being asserted [with the axiom of choice] beyond fiat syntax when confronted with an unbounded quantifier. — sime
The axiom of choice is intuitive. One is free to reject it, but you are incorrect to say that mathematicians don't know what the axiom asserts.
And the axiom of regularity doesn't contribute to a claim that what Cantor meant by 'absolute infinity' is what you mean by it.
The Axiom of Extensionality : According to absolute infinity, two functions with the same domain that agree on 'every' point in the domain must be the same function. — sime
No, according to what YOU mean by 'absolute infinity'; it's not what Cantor meant.
And the axiom of extensionality doesn't contribute to a claim that what Cantor meant by 'absolute infinity' is what you mean by it.
Even more basically, even though ZFC does capture a great deal of Cantorian set theory (but not including Cantor's 'absolute infinity'), that does not entail that what Cantor meant by 'absolute infinity' is what you mean by it.