The equivalence of R.E. program schemes and data flow schemes
作者：
Highlights：
•
摘要
The expressive 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.
论文关键词：
论文评审过程：Received 1 March 1979, Revised 24 April 1980, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(80)90044-6
