question
active
question:what-are-the-analogues-to-turing-completeness-and-universality-when-we-are-concerned-with-processes-and-their-behaviours

What are the analogues to Turing-completeness and universality when we are concerned with processes and their behaviours?

Key open problem: foundational definitions for process models that match the role of Turing completeness for functional computation.

Source paper

extracted_from
Information, Processes and Games
Abramsky, Samson

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.