| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662870 | Journal of Applied Logic | 2014 | 8 Pages |
Abstract
It is shown how the operators in the “graph model” for λ-calculus (which can function as a programming language for Recursive Function Theory) can be expanded to allow for “random combinators”. The result then is a model for a new language for random algorithms.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Dana S. Scott,