Content deleted Content added
Line 343:
[[User:Thepigdog|Thepigdog]] ([[User talk:Thepigdog|talk]]) 01:10, 10 January 2014 (UTC)
I have taken out,
"In these formalizations, the existence of a fixed-point combinator means that ''every function has at least one fixed point;'' a function may have more than one distinct fixed point."
I don't believe this statement, but will happily eat crow if someone can show me a fixed point term in normal form for the function,
:<math>\lambda p.\lambda a.\lambda b.p\ b\ a</math>
The basis of learning is finding out you are wrong so please prove me wrong, and I will put the statement back.
==Its not magic==
| |||