Computable process
Published • Jan 1, 1990
NobleIDNI9P844W611R003S833
Authors:
Yiannis N. Moschovakis
Abstract
In this paper we study concurrent, asynchronous processes and functions on them which can be programmed using the (full) unfair or the fair merge operations. The main result is a normal form theorem for these (relatively) “computable process functions” which implies that although they can be very co...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!