> 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 _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
- beginner's questions - fix f Bob Koutsky
- Re: beginner's questions - fix f Lars Henrik Mathiesen
- Re: beginner's questions - fix f Andreas Rossberg
- Re: beginner's questions - fix f Samuel E . Moelius III
- Re: beginner's questions - fix f Marcin 'Qrczak' Kowalczyk
- Re: beginner's questions - fix f Lars Henrik Mathiesen
- Re: beginner's questions - fix f Lennart Augustsson