Wikipedia:Articles for deletion/Recursion termination
[Hide this box] New to Articles for deletion (AfD)? Read these primers!
- Recursion termination (edit | talk | history | protect | delete | links | watch | logs | views) – (View log · Stats)
- (Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)
The article's content is already present in Recursion (computer science) and Termination analysis (the link from the latter to Recursion termination is misleading, as Recursion termination doesn't provide any new information). The article is poorly written, doesn't have reliable inline citations, and wasn't worked upon (except for small edits) for 10 years. - Jochen Burghardt (talk) 11:50, 28 January 2019 (UTC)
- Note: This discussion has been included in the list of Computing-related deletion discussions. - Jochen Burghardt (talk) 11:52, 28 January 2019 (UTC)
- Merge into Recursion (computer science) per WP:ATD, WP:BEFORE, WP:PRESERVE. Andrew D. (talk) 12:52, 28 January 2019 (UTC)
- Merge as above. StrayBolt (talk) 16:42, 28 January 2019 (UTC)
- Comment: I have no objection to a merge, but I am afraid it will change almost nothing in Recursion (computer science). The role of base cases for termination is mentioned in section Recursion (computer science)#Recursive functions and algorithms; it could be made slightly more clear. The factorial example from Recursion termination is already present in Recursion (computer science)#Factorial. The fibonacci example could of course be added as yet another recursive function. By the way: both examples fail to notice that the functions will not terminate when called with a negative agument. - Jochen Burghardt (talk) 18:44, 28 January 2019 (UTC)
- Redirect to Recursion (computer science) per the above observations by the OP. -Ad Orientem (talk) 02:15, 5 February 2019 (UTC)