Pages that link to "Item:Q5537605"
From MaRDI portal
The following pages link to A Machine-Independent Theory of the Complexity of Recursive Functions (Q5537605):
Displaying 50 items.
- A note on the best-case complexity (Q1120281) (← links)
- Data representation and computational complexity (Q1132872) (← links)
- Complexity classes of provable recursive functions (Q1134153) (← links)
- Indexings of subrecursive classes (Q1140080) (← links)
- Hierarchy of complexity of computation of partial functions with values 0 and 1 (Q1149431) (← links)
- Research in the theory of inductive inference by GDR mathematicians - A survey (Q1151889) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- Theory construction in psychology: The interpretation and integration of psychological data (Q1157291) (← links)
- Two types of properties for complexity measures (Q1158961) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- Optimal algorithms for co-NP-sets and the EXP\(\overset{!}{ = }\)NEXP problem (Q1178072) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- Aggregating inductive expertise on partial recursive functions (Q1187022) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- The extent and density of sequences within the minimal-program complexity hierarchies (Q1212360) (← links)
- Closure operations on measures of computational complexity (Q1219561) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- The non-renamability of honesty classes (Q1220385) (← links)
- Complexity classes of partial recursive functions (Q1221487) (← links)
- The computational complexity of program schemata (Q1223162) (← links)
- An operator embedding theorem for complexity classes of recursive functions (Q1225934) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- Nonexistence of program optimizers in several abstract settings (Q1231391) (← links)
- On computational reducibility (Q1232281) (← links)
- Complexity-class-encoding sets (Q1237360) (← links)
- ``Natural'' properties of flowchart step-counting measures (Q1242679) (← links)
- Some natural properties of strong-identification in inductive inference (Q1244823) (← links)
- On the inference of optimal descriptions (Q1245956) (← links)
- Some applications of the McCreight-Meyer algorithm in abstract complexity theory (Q1249043) (← links)
- On splitting recursive sets (Q1251652) (← links)
- The complexity of total order structures (Q1253249) (← links)
- Some lowness properties and computational complexity sequences (Q1255315) (← links)
- Finite approximate approach to the study of the complexity of recursive predicates (Q1255316) (← links)
- Sequential fuzzy system identification (Q1255466) (← links)
- Complexity properties of recursively enumerable sets and \(sQ\)-completeness (Q1277538) (← links)
- Learning with refutation (Q1278041) (← links)
- Forecasting errors and bounded rationality: An example (Q1296456) (← links)
- On average time hierarchies (Q1313704) (← links)
- A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- On speedable and levelable vector spaces (Q1326776) (← links)
- Characterizing language identification by standardizing operations (Q1333402) (← links)
- On recursive bounds for the exceptional values in speed-up (Q1334675) (← links)
- Program size restrictions in computational learning (Q1342242) (← links)
- Computational complexity of functions (Q1351510) (← links)
- Learning in the presence of inaccurate information (Q1351959) (← links)
- On aggregating teams of learning machines (Q1367526) (← links)
