The following pages link to New Computational Paradigms (Q5717025):
Displaying 10 items.
- Computational inductive definability (Q598276) (← links)
- Comparing inductive and circular definitions: Parameters, complexity and games (Q817681) (← links)
- Representation theorems for transfinite computability and definability (Q1407571) (← links)
- Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
- An almost machine-independent theory of program-length complexity, sophistication, and induction (Q2638781) (← links)
- First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo (Q2758045) (← links)
- The complexity of definability by open first-order formulas (Q3386916) (← links)
- On the complexity of inductive definitions (Q3422019) (← links)
- Inductive Complexity of Goodstein’s Theorem (Q4648198) (← links)
- The Exact Complexity of the First-Order Logic Definability Problem (Q5012557) (← links)