Revision as of 13:30, 9 January 2014 edit Thepigdog (talk \| contribs) Extended confirmed users 5,174 edits →Existence of fixed-point combinators ← Previous edit		Revision as of 23:38, 9 January 2014 edit undo Haklo (talk \| contribs) 96 edits →Existence of fixed-point combinators Next edit →
Line 322: [[User:Thepigdog\|Thepigdog]] ([[User talk:Thepigdog\|talk]]) 10:03, 9 January 2014 (UTC) : Every function has at least one fixed point ''in (untyped) lambda calculus''. The example you have given implies something like a boolean algebra, which will not have fixed points for all functions. If you give some lambda expressions instead the fixed point will be obvious (more or less). [[User:Haklo\|Haklo]] ([[User talk:Haklo\|talk]]) 23:38, 9 January 2014 (UTC) ==Its not magic==

Talk:Fixed-point combinator: Difference between revisions