The following pages link to Frank Stephan (Q324251):
Displaying 50 items.
- Reductions between types of numberings (Q2326424) (← links)
- Exact satisfiabitity with jokers (Q2327478) (← links)
- Cone avoidance and randomness preservation (Q2344623) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- A reducibility related to being hyperimmune-free (Q2349101) (← links)
- On the data consumption benefits of accepting increased uncertainty (Q2381574) (← links)
- Invertible classes (Q2382282) (← links)
- Results on memory-limited U-shaped learning (Q2384927) (← links)
- Boolean algebras realized by c.e. equivalence relations (Q2403654) (← links)
- Results on spaces between the Sorgenfrey and usual topologies on \(\mathbb{R}\) (Q2411469) (← links)
- Uncountable automatic classes and learning (Q2431428) (← links)
- A note on enlargements and generalized neighbourhood systems (Q2448932) (← links)
- Lowness properties and approximations of the jump (Q2478546) (← links)
- Bounding computably enumerable degrees in the Ershov hierarchy (Q2498901) (← links)
- Variations on U-shaped learning (Q2500523) (← links)
- Sets without subsets of higher many-one degree (Q2565991) (← links)
- What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
- Kolmogorov-Loveland randomness and stochasticity (Q2576945) (← links)
- Effectivity questions for Kleene's recursion theorem (Q2636408) (← links)
- Initial segment complexities of randomness notions (Q2637318) (← links)
- Robust learning of automatic classes of languages (Q2637647) (← links)
- Automatic learners with feedback queries (Q2637649) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- String compression in FA-presentable structures (Q2682935) (← links)
- On the structures inside truth-table degrees (Q2747717) (← links)
- A splitting theorem for \(n\)-REA degrees (Q2750871) (← links)
- (Q2754021) (← links)
- (Q2754201) (← links)
- (Q2757846) (← links)
- Isolation and the jump operator (Q2765575) (← links)
- Learning Automatic Families of Languages (Q2794337) (← links)
- Learning Pattern Languages over Groups (Q2830276) (← links)
- Selectively \((a)\)-spaces from almost disjoint families are necessarily countable under a certain parametrized weak diamond principle (Q2834139) (← links)
- Priced Learning (Q2835616) (← links)
- Combining Models of Approximation with Partial Learning (Q2835617) (← links)
- Automatic functions, linear time and learning (Q2848364) (← links)
- Partial Learning of Recursively Enumerable Languages (Q2859210) (← links)
- Improved nearness research. II (Q2871484) (← links)
- Learnability of Co-r.e. Classes (Q2890197) (← links)
- Learning Families of Closed Sets in Matroids (Q2891307) (← links)
- On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data (Q2898054) (← links)
- Automatic Functions, Linear Time and Learning (Q2904399) (← links)
- On the Role of Update Constraints and Text-Types in Iterative Learning (Q2938723) (← links)
- Arithmetic complexity via effective names for random sequences (Q2946673) (← links)
- Depth, Highness and DNR Degrees (Q2947871) (← links)
- Inductive Inference and Reverse Mathematics (Q2955013) (← links)
- Closed left-r.e. sets (Q2964277) (← links)
- Weakly Represented Families in Reverse Mathematics (Q2970957) (← links)
- The Complexity of Verbal Languages over Groups (Q2986816) (← links)
- A Survey on Recent Results on Partial Learning (Q2989964) (← links)
