Andrea Asperti questions

Andrea Asperti answers

• In functional languages, how is the compiler able to translate non-tail recursion into loops to avoid stack overflows (if at all)?
• lambda calculus, normal order, normal form,
• Can it be proved that call-by-need has the minimal asymptotic time complexity among all reduction strategies?
• Is it possible to evaluate lambda calculus terms efficiently?
• Is poly-time functions class recursively enumerable?
• Are there any Recursively Enumerable problems that are not RE-hard?
• Can a Turing machine perform Quicksort?