The following pages link to (Q3992696):
Displaying 11 items.
- The influence of domain interpretations on computational models (Q1036525) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- A family of fuzzy programming languages (Q1278884) (← links)
- Partition theorems for factorizations of ascending parameter words (Q1292842) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- Linear programs in a simple reversible language. (Q1401215) (← links)
- Subrecursive Complexity of Identifying the Ramsey Structure of Posets (Q3507434) (← links)
- On the Meaning Maximization Doctrine: An Alternative to the Utilitarian Doctrine (Q5011345) (← links)
- Efficient unidimensional universal cellular automaton (Q5096850) (← links)
- The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
- On a class of fuzzy computable functions (Q5947561) (← links)
