The following pages link to (Q5183082):
Displaying 14 items.
- On the mathematical foundations of \textit{Syntactic structures} (Q438597) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Polynomial time computations in models of ET (Q795035) (← links)
- On the complexity-relativized strong reducibilities (Q800353) (← links)
- Some notes on Church's thesis and the theory of games (Q911776) (← links)
- A consideration of a practical implementation for a new convergence division (Q1055188) (← links)
- The recursion-theoretic structure of complexity classes (Q1064320) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- Two types of properties for complexity measures (Q1158961) (← links)
- On the structure of sets in NP and other complexity classes (Q1162811) (← links)
- Forecasting errors and bounded rationality: An example (Q1296456) (← links)
- (Q3947144) (← links)
- (Q4144811) (← links)
- (Q4168085) (← links)