Pages that link to "Item:Q3853126"
From MaRDI portal
The following pages link to Finite alogorithmic procedures and computation theories. (Q3853126):
Displayed 6 items.
- A difference in complexity between recursion and tail recursion (Q519902) (← links)
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) (Q1683704) (← links)
- Computability by nondeterministic program and the Moschovakis search computability (Q1905256) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- Feferman on Computability (Q5214780) (← links)