TY - JOUR
AU - Goldberg, Mayer
PY - 2005/01/11
Y2 - 2023/05/29
TI - On the Recursive Enumerability of Fixed-Point Combinators
JF - BRICS Report Series
JA - BRICS
VL - 12
IS - 1
SE - Articles
DO - 10.7146/brics.v12i1.21867
UR - https://tidsskrift.dk/brics/article/view/21867
SP -
AB - We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger set of terms we call non-standard fixed-point combinators. These terms are observationally equivalent to fixed-point combinators in any computable context, but the set of on-standard fixed-point combinators is not recursively enumerable.
ER -