On Jan 13, 2013 10:04 AM, "Ross Bencina" <rossb-lists_at_audiomulch.com> wrote:
> all general purpose programming languages and modern machine instruction
sets are Turing complete, apart from having finite memory.
An interesting and common point in PL design involves supporting universal
computation only in the extent - I.e. where the program interacts with time
or IO. Every subprogram in such a language might be guaranteed to complete,
perhaps even in real time or bounded time.
I believe such languages are superior for live programming, even though the
programmer never uses TC expressions.
Received on Sun Jan 13 2013 - 18:46:43 GMT