Pages that link to "Definition:Unlimited Register Machine/Program/Termination"
Jump to navigation
Jump to search
The following pages link to Definition:Unlimited Register Machine/Program/Termination:
Displayed 14 items.
- Single Instruction URM Programs (← links)
- Concatenation of URM Programs is Associative (← links)
- Function Obtained by Substitution from URM Computable Functions (← links)
- Normalized URM Program (← links)
- Function Obtained by Primitive Recursion from URM Computable Functions (← links)
- Unique Code for State of URM Program (← links)
- State Code Function is Primitive Recursive (← links)
- URM Computable Function is Recursive (← links)
- Kleene's Normal Form Theorem (← links)
- Halting Problem is Not Algorithmically Decidable (← links)
- Set of Total Functions is Not Recursive (← links)
- User:Prime.mover/Constructs (← links)
- Definition:URM Computability (← links)
- Definition:Unlimited Register Machine/Program (transclusion) (← links)