Conversation

Notices

1. ∑ XahLee (xahlee@noagendasocial.com)'s status on Wednesday, 01-Nov-2017 08:20:55 EDT ∑ XahLee

   xah edu corner extempore! episode №20171101042745, ban recursion in programing languages

   1 with regards to computer science, recursion should be ban'd in programing languages.

   2 it's got the chicken n egg problem: before it's defined, it's calling itself. Like russell's paradox, or 1st order logic in twilight zone

   3 But in math, we have recursive relation, and comp sci recursive theory. How to resolve that?

   1. ∑ XahLee (xahlee@noagendasocial.com)'s status on Wednesday, 01-Nov-2017 08:21:23 EDT ∑ XahLee

      in reply to

      4 in math, nth term is defined by previous term, and f[1] is defined non-recursively. so, it's well defined. In a sense, no “recursion”

      5 in most programing langs, body of recursive f use “if” to check input. So, “no recursion” really. But chicken n egg remain in defining f.

      1. ∑ XahLee (xahlee@noagendasocial.com)'s status on Wednesday, 01-Nov-2017 08:21:41 EDT ∑ XahLee

         in reply to

         6 some lang, (Mathematica, haskell), can define f(1) and f(n) separately. So, no chicken n egg recursive definition problem.

         7 actually chicken n egg recursive definition problem remain. With respect to order of evaluation.