The following pages link to (Q5612462):
Displaying 23 items.
- Defining effectiveness using finite sets. A study on computability (Q529651) (← links)
- Succinct iterative characterizations of primitive computable unary functions (Q672834) (← links)
- Calvin C. Elgot (1922-1980) (Q788706) (← links)
- Modular tree transducers (Q807012) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- Introduction to Turing categories (Q998306) (← links)
- Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems (Q1073019) (← links)
- Algebra of constructions. I. The word problem for partial algebras (Q1107515) (← links)
- Primitive iteration and unary functions (Q1115608) (← links)
- The first example of a recursive function which is not primitive recursive (Q1135847) (← links)
- Computable stack functions for semantics of stack programs (Q1137385) (← links)
- Sequence recursiveness without cylindrification and limited register machines (Q1154263) (← links)
- In memoriam Calvin C. Elgot (Q1154455) (← links)
- General iteration and unary functions (Q1182467) (← links)
- Proving a compiler correct: A simple approach (Q1216945) (← links)
- Sequence-to-sequence recursiveness (Q1219273) (← links)
- Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) (Q1798794) (← links)
- (Q3947144) (← links)
- (Q3962978) (← links)
- (Q4186306) (← links)
- (Q5013820) (← links)
- Aspects of Categorical Recursion Theory (Q5014598) (← links)
- Characterization of recursively enumerable sets (Q5677466) (← links)
