On the Recursive Enumerability of Fixed-Point Combinators

Authors

  • Mayer Goldberg

DOI:

https://doi.org/10.7146/brics.v11i25.21850

Abstract

We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger set of terms that is (A) not recursively enumerable, and (B) the terms of which are observationally equivalent to fixed-point combinators in any computable context.

Downloads

Published

2004-11-11

How to Cite

Goldberg, M. (2004). On the Recursive Enumerability of Fixed-Point Combinators. BRICS Report Series, 11(25). https://doi.org/10.7146/brics.v11i25.21850

Issue

No. 25 (2004): RS-25 On the Recursive Enumerability of Fixed-Point Combinators

Section

Articles

License

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.