The following pages link to (Q2762147):
Displaying 12 items.
- On primitive recursive algorithms and the greatest common divisor function (Q1399976) (← links)
- The never-ending recursion (Q1688713) (← links)
- Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
- Axiomatization and characterization of BSP algorithms (Q2011205) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Proof-theoretic notions for software maintenance (Q4923374) (← links)
- A Behavioural Theory of Recursive Algorithms (Q4988914) (← links)
- A Characterization of Distributed ASMs with Partial-Order Runs (Q5040367) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- Language for Description of Worlds. Part 2: The Sample World (Q6136054) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
