On the Recursive Enumerability of Fixed-Point Combinators

  • Goldberg M
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Goldberg, M. (2005). On the Recursive Enumerability of Fixed-Point Combinators. BRICS Report Series, 12(1). https://doi.org/10.7146/brics.v12i1.21867

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

40%

Researcher 2

40%

Professor / Associate Prof. 1

20%

Readers' Discipline

Tooltip

Mathematics 3

50%

Computer Science 2

33%

Engineering 1

17%

Save time finding and organizing research with Mendeley

Sign up for free