The following information passed a request for deletion.
This discussion is no longer live and is left here as an archive. Please do not modify this conversation, but feel free to discuss its conclusions.
SoP, not idiomatic. (Note: I also just removed a secondary computing sense, since the first sense says it all for computing as well.) P.S. Is this a reasonable sort of RFD nomination? Connel has been remarking (1, 2) that SoP isn't sufficient as a nomination, whereas quite a few such RFDs went ahead before without question. Where I say that, I do also mean to suggest that it's not idiomatic (cf. CFI's "this is a door" example). Equinox ◑ 21:01, 5 March 2009 (UTC)
- Since this is a technical term I think it should be kept. I found SB's computing definition much more informative than the generic definition that remains. If it were just the generic definition that were required then of course, delete it, but being a technical term the other makes it worth keeping. DAVilla 02:45, 6 March 2009 (UTC)
- Even though it's just a recursion (usual computing sense) that happens to be infinite? Whether you're a programmer or not, these two words together are still an adjective qualifying a noun, just like recursive loop, infinite loop, recursive method — not an inextricable two-word phrase. The description might have been useful encyclopaedically but that's Wikipedia's area. Equinox ◑ 02:50, 6 March 2009 (UTC)
- I'm reconsidering. DAVilla 13:25, 7 March 2009 (UTC)
- It isn't "recursion without limits", infinite recursion is the endless repetition of a specific instance of recursion. I had to think for a bit on this one too, but I think the combination is specific enough compared to the breadth of the components that it qualifies under CFI. This specific conecpt is very important in both computing and mathematics. --EncycloPetey 18:16, 15 March 2009 (UTC)
- Well, I don't think it has to be a specific instance. Why do you say that? On what evidence do you base it? I think it usually refers to a repeated specific instance, but that might well be something you take from context and domain-specific knowledge; it doesn't necessarily rule out other possibilities. Equinox ◑ 00:25, 21 March 2009 (UTC)
- But if we have no evidence that those "other possibilities" are ever intended, then the point is moot. Our entries describe how the words are actually used, not how they might be construed. --EncycloPetey 05:57, 24 March 2009 (UTC)
- Okay. How do you feel about This recursion is infinite, or recursive in an infinite way? Do these indicate the same sort of thing as infinite recursion, and if so don't they suggest that it's a sense of one word or the other, and not this specific two-word combination? Equinox ◑ 22:15, 24 March 2009 (UTC)
- It's taken me some time to think this over. I have to conclude that "This recursion is infinite" does not mean the same thing to me as infinite recursion (in the mathematical sense), but I'm having a difficult time articulating why that is and how the two constructions differ in meaning. I can say that the sentence seems very awkward to me. On the other hand, "recursive in an infinite way" seems to describe the same concept, and "This recursion is infinite" does seem to convey the computing sense of infinite recursion. I wish we had more mathematicians active here. --EncycloPetey 05:06, 5 April 2009 (UTC)
- Keep. The difference is that infinite recursion applies to a single construct or occasionally a tight system (such as two interdependent functions) which never exits, but typically doing some repetitive, misdirected calculation at the same time, whereas a program can continue without end for other reasons, such as never receiving any input. Also, this is generally seen as a fault (unless the meta language is specifically designed to handle it, but those languages are more mathematical than the usual iterative style), whereas a program that is designed to run forever, though it recurses infinitely, by doing useful work is not an infinite recursion in the same meaning, only in a broader sense. DAVilla 13:23, 14 May 2009 (UTC)
At worst, no consensus. Kept.—msh210℠ 22:12, 19 August 2009 (UTC)