On the Recursive Enumerability of Fixed-Point Combinators

Forfattere

  • Mayer Goldberg

DOI:

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

Resumé

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

Publiceret

2004-11-11

Citation/Eksport

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

Nummer

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

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).