The following pages link to (Q4153600):
Displaying 50 items.
- How rich is the structure of the intrinsic complexity of learning (Q294809) (← links)
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- Defining effectiveness using finite sets. A study on computability (Q529651) (← links)
- Decision problems of object histories (Q582039) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- Program self-reference in constructive Scott subdomains (Q693046) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- On the complexity-relativized strong reducibilities (Q800353) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- On the inference of approximate programs (Q803121) (← links)
- Training sequences (Q811136) (← links)
- On the learnability of vector spaces (Q859986) (← links)
- Informal versus formal mathematics (Q885512) (← links)
- A note on A.E. h-complex functions (Q909459) (← links)
- Polynomials and linear transformations (Q913885) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- Probabilistic and team PFIN-type learning: General properties (Q927866) (← links)
- Taming teams with mind changes (Q927869) (← links)
- Computation, hypercomputation, and physical science (Q959046) (← links)
- Acceptable functional programming systems (Q1061487) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP (Q1079364) (← links)
- How to prove representation-independent independence results (Q1091820) (← links)
- Honest polynomial degrees and \(P=?NP\) (Q1094875) (← links)
- Probability and plurality for aggregations of learning machines (Q1104113) (← links)
- More complicated questions about maxima and minima, and some closures of NP (Q1107524) (← links)
- On the relative sizes of learnable sets (Q1128667) (← links)
- Indexings of subrecursive classes (Q1140080) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- Remarks on recursion versus diagonalization and exponentially difficult problems (Q1156483) (← links)
- Independence results in computer science? (Q1158957) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets (Q1199689) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Minimum-complexity pairing functions (Q1201876) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- On the inductive inference of recursive real-valued functions (Q1292395) (← links)
- Maximal machine learnable classes (Q1305936) (← links)
- Composition is almost (but not quite) as good as \(s-1-1\) (Q1314366) (← links)
- A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
- On recursive bounds for the exceptional values in speed-up (Q1334675) (← links)
