Talk:Fixed-point combinator: Difference between revisions

Content deleted Content added
Haklo (talk | contribs)
Line 363:
:: So based on this argument only a term in normal form will do.
:: Kind regards [[User:Thepigdog|Thepigdog]] ([[User talk:Thepigdog|talk]]) 09:08, 13 January 2014 (UTC)
 
::: Lambda terms are mathematical objects in their own right, just like sets (for example), and lambda calculus is its own mathematical theory. The "data types" and "conversions" you are talking about are further considerations, and not relevant to what is true or false in lambda calculus. In this particular discussion, when we talk about finding the fixed point to a function, the function we mean ''is'' a lambda term; it is ''not'' a function in a different theory which has been "converted" to a lambda term. Such a "converted function" question is a very different question, more along the lines of lambda definability. Finally, because the "fixed point question" is a question about lambda terms (and nothing else), normal form is not relevant. [[User:Haklo|Haklo]] ([[User talk:Haklo|talk]]) 22:50, 14 January 2014 (UTC)
 
==Its not magic==