The following pages link to Frank Stephan (Q324251):
Displaying 50 items.
- On one-sided versus two-sided classification (Q1407503) (← links)
- On the hierarchy and extension of monotonically computable real numbers. (Q1426053) (← links)
- Learning how to separate. (Q1426149) (← links)
- Learning by switching type of information. (Q1427864) (← links)
- Complementing cappable degrees in the difference hierarchy. (Q1428038) (← links)
- Robust learning aided by context (Q1567396) (← links)
- Structural measures for games and process control in the branch learning model (Q1575709) (← links)
- Bounding cappable degrees (Q1576591) (← links)
- Classes bounded by incomplete sets (Q1602854) (← links)
- Avoiding coding tricks by hyperrobust learning (Q1603596) (← links)
- On the values for factor complexity (Q1616983) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- Regular patterns, regular languages and context-free languages (Q1675877) (← links)
- Semiautomatic structures (Q1694004) (← links)
- Limit-depth and DNR degrees (Q1708266) (← links)
- The complexity of verbal languages over groups (Q1713480) (← links)
- Domain theoretical differential calculi (Q1731344) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Equivalences between learning of data and probability distributions, and their applications (Q1784951) (← links)
- Nonisolated degrees and the jump operator (Q1849858) (← links)
- Learning classes of approximations to non-recursive functions. (Q1853518) (← links)
- The complexity of universal text-learners. (Q1854315) (← links)
- Learning to win process-control games watching game-masters (Q1854518) (← links)
- Refuting learning revisited. (Q1874232) (← links)
- Learning power and language expressiveness. (Q1874277) (← links)
- Trees and learning (Q1878683) (← links)
- Robust learning -- rich and poor (Q1880777) (← links)
- Generalized notions of mind change complexity (Q1881221) (← links)
- Counting extensional differences in BC-learning (Q1887167) (← links)
- Quantifying the amount of verboseness (Q1891135) (← links)
- Approximable sets (Q1898468) (← links)
- Recursion theoretic properties of frequency computation and bounded queries (Q1898479) (← links)
- Language learning from texts: Mindchanges, limited memory and monotonicity (Q1908348) (← links)
- Inclusion problems in parallel learning and games (Q1924379) (← links)
- Highness, locally noncappability and nonboundings (Q1944327) (← links)
- Automata on ordinals and automaticity of linear orders (Q1944328) (← links)
- A unified theory of generalized closed sets in weak structures (Q1945244) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- Sub-posets in \(\omega^\omega\) and the strong Pytkeev\(^*\) property (Q2049864) (← links)
- On the amount of nonconstructivity in learning formal languages from text (Q2051759) (← links)
- Randomness and initial segment complexity for measures (Q2062126) (← links)
- Lamplighter groups and automata (Q2170284) (← links)
- Generalized quotient topologies and hereditary classes (Q2204094) (← links)
- Learnability and positive equivalence relations (Q2232273) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- Bi-immunity over different size alphabets (Q2243580) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
