On Sun, Jan 13, 2013 at 4:11 AM, Ross Bencina <rossb-lists_at_audiomulch.com>wrote:
>
> PD is a Turing complete language anyway..
>>
>
> Indeed. However David gave the example of Pd being used without
> conditional logic.
Charles gave that example. But I didn't disagree with it.
>
> When I referred to deterministic dataflow programming I had in mind
> networks that can be expressed in a directed acyclic graph.
>
Dataflow can be cyclic, so long as you model data as flowing through time
as well as space.
Received on Sun Jan 13 2013 - 17:01:00 GMT