The following pages link to (Q5573961):
Displaying 50 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Functional equations for the functions of real variables (Q263953) (← links)
- A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic (Q266237) (← links)
- On hyperarithmetical realizability (Q268079) (← links)
- On elementary theories of ordinal notation systems based on reflection principles (Q281010) (← links)
- Orbits of maximal vector spaces (Q282117) (← links)
- The bi-embeddability relation for finitely generated groups. II (Q283098) (← links)
- Reverse mathematics, well-quasi-orders, and Noetherian spaces (Q283113) (← links)
- Reverse complexity (Q287279) (← links)
- How rich is the structure of the intrinsic complexity of learning (Q294809) (← links)
- Equations over sets of integers with addition only (Q295632) (← links)
- Implicit definability in arithmetic (Q306821) (← links)
- Infinite games specified by 2-tape automata (Q324245) (← links)
- A map of update constraints in inductive inference (Q329603) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Enlarging learnable classes (Q342717) (← links)
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- A note on definability in fragments of arithmetic with free unary predicates (Q365661) (← links)
- Simulation of effective subshifts by two-dimensional subshifts of finite type (Q368710) (← links)
- The FE-closure operator in countable-valued logic (Q384749) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Learning and classifying (Q390916) (← links)
- Iterative learning from positive data and counters (Q391750) (← links)
- Reactive Turing machines (Q393091) (← links)
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- Streamlined subrecursive degree theory (Q408165) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Intuitionistic logic and Muchnik degrees (Q412013) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Effectively approximating measurable sets by open sets (Q418744) (← links)
- Computation as an unbounded process (Q418791) (← links)
- Fine hierarchies via Priestley duality (Q424549) (← links)
- Reducibility on families (Q431669) (← links)
- Autostability of prime models under strong constructivizations (Q431714) (← links)
- On the mathematical foundations of \textit{Syntactic structures} (Q438597) (← links)
- Learning with ordinal-bounded memory from positive data (Q440010) (← links)
- A personal account of Turing's imprint on the development of computer science (Q465701) (← links)
- Nonpresentability of the semigroup \(\omega^\omega\) over \(\mathbb H\mathbb F(\mathbb R)\) (Q467668) (← links)
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts (Q494068) (← links)
- Proper divisibility in computable rings (Q504325) (← links)
- Ordinals and graph decompositions (Q508830) (← links)
- Complexity of equational theory of relational algebras with standard projection elements (Q514569) (← links)
- Frugal bribery in voting (Q527399) (← links)
- Topological aspects of the Medvedev lattice (Q535142) (← links)
- Immunity properties and strong positive reducibilities (Q535145) (← links)
- Topological dynamics of cellular automata: dimension matters (Q537911) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Theory of Abelian groups with constructive models (Q579238) (← links)
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- Hierarchies of torsion-free Abelian groups (Q579244) (← links)
