We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

The Equivalence of R. E. Programs and Data Flow Schemes

Thumbnail Image
Download
Name

MIT-LCS-TM-121.pdf

Size

5.88 MB

Format

Adobe PDF

Checksum (MD5)

7688e0969cea75396d12f0a3461ecc50

Author(s)
Jaffe, Jeffrey
Date Issued
January 1979
Series/Report no.
MIT-LCS-TM-121
Abstract
The Expressibe power of the data flow schemes of Dennis is evaluated. It is shown that data flow schemes have the power to express an arbitrary determinate functional. The proof involves a demonstration that "restricted data flow schemes" can simulate Turing Machines. This provides a new, simple basis for computability.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.