Pages that link to "Item:Q5729305"
From MaRDI portal
The following pages link to Computability of Recursive Functions (Q5729305):
Displayed 17 items.
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- On the power of several queues (Q685436) (← links)
- A process algebraic view of Linda coordination primitives (Q1127512) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- Comparing three semantics for Linda-like languages (Q1575148) (← links)
- Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
- Counter machines (Q1606993) (← links)
- The \(\exists\forall^2\) fragment of the first-order theory of atomic set constraints is \(\Pi_1^0\)-hard (Q1607043) (← links)
- On the computational strength of pure ambient calculi (Q1763730) (← links)
- On the expressiveness of Linda coordination primitives. (Q1854324) (← links)
- Expired data collection in shared dataspaces. (Q1874282) (← links)
- On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
- The expressiveness of locally stratified programs (Q1924734) (← links)
- A simple proof of the undecidability of inhabitation in λP (Q3125231) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
- Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles (Q5687408) (← links)