3 Jan
1970
3 Jan
'70
12:05 p.m.
Function fix is a so-called fixpoint operator. Theory says that you can formulate any computable function using only non-recursive definitions plus fix.
Could someone point me toward a proof of this? Furthermore, can any computable function be expressed in this form: fix u where u is some non-recursive term? Sam Moelius