Citation: Turing Completeness Totally Free, by McBride.
That paper says that you can have general recursion without Turing conpleteness, which is about the opposite of your claim.
-
-
Yes I overstated. You need general recursion, but that does not require partial functions or logical inconsistencies.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.