Since 2014
On the Recursive Enumerability of Fixed-Point Combinators
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
On the Recursive Enumerability of Fixed-Point Combinators
|
|
| Creator |
Goldberg, Mayer
|
|
| Description |
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.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
2005-01-11
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/21867
10.7146/brics.v12i1.21867 |
|
| Source |
BRICS Report Series; No 1 (2005): RS-1 On the Recursive Enumerability of Fixed-Point Combinators
BRICS Report Series; No 1 (2005): RS-1 On the Recursive Enumerability of Fixed-Point Combinators 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/21867/19294
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|