Uniformity in learning structures
Fuente:
arXiv
Saved in:
| Main Authors: | Cipriani, Vittorio, Rossegger, Dino |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Classifying different criteria for learning algebraic structures
by: Bazhenov, Nikolay, et al.
Published: (2024)
by: Bazhenov, Nikolay, et al.
Published: (2024)
Learning Equivalence Relations on Polish Spaces
by: Rossegger, Dino, et al.
Published: (2024)
by: Rossegger, Dino, et al.
Published: (2024)
On the learning power of Friedman-Stanley jumps
by: Cipriani, Vittorio, et al.
Published: (2025)
by: Cipriani, Vittorio, et al.
Published: (2025)
The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026)
by: Camerlo, Riccardo, et al.
Published: (2026)
Classifying the complexity of models of arithmetic
by: Gonzalez, David, et al.
Published: (2025)
by: Gonzalez, David, et al.
Published: (2025)
Scott sentence complexities of linear orderings
by: Gonzalez, David, et al.
Published: (2023)
by: Gonzalez, David, et al.
Published: (2023)
Hyperfiniteness on Topological Ramsey Spaces
by: Bursics, Balázs, et al.
Published: (2024)
by: Bursics, Balázs, et al.
Published: (2024)
Dichotomy results for classes of countable graphs
by: Cipriani, Vittorio, et al.
Published: (2025)
by: Cipriani, Vittorio, et al.
Published: (2025)
Information vs Dimension -- an Algorithmic Perspective
by: Reimann, Jan
Published: (2024)
by: Reimann, Jan
Published: (2024)
Hausdorff dimension and countable Borel equivalence relations
by: Marks, Andrew, et al.
Published: (2024)
by: Marks, Andrew, et al.
Published: (2024)
Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)
by: Hertling, Peter, et al.
Published: (2025)
The Borel complexity of the class of models of first-order theories
by: Andrews, Uri, et al.
Published: (2024)
by: Andrews, Uri, et al.
Published: (2024)
Choiceless Polynomial Space
by: Ferrarotti, Flavio, et al.
Published: (2024)
by: Ferrarotti, Flavio, et al.
Published: (2024)
On the incomputability of computable dimension
by: Staiger, Ludwig
Published: (2019)
by: Staiger, Ludwig
Published: (2019)
Learning Families of Algebraic Structures from Text
by: Bazhenov, Nikolay, et al.
Published: (2024)
by: Bazhenov, Nikolay, et al.
Published: (2024)
Solovay reducibility implies S2a-reducibility
by: Titov, Ivan
Published: (2024)
by: Titov, Ivan
Published: (2024)
A total Solovay reducibility and totalizing of the notion of speedability
by: Merkle, Wolfgang, et al.
Published: (2024)
by: Merkle, Wolfgang, et al.
Published: (2024)
Algorithmic aspects of left-orderings of solvable Baumslag--Solitar groups via its dynamical realization
by: Ho, Meng-Che "Turbo", et al.
Published: (2024)
by: Ho, Meng-Che "Turbo", et al.
Published: (2024)
Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
by: Kattermann, David, et al.
Published: (2025)
by: Kattermann, David, et al.
Published: (2025)
A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)
by: Buss, Sam, et al.
Published: (2025)
Uniform Computability of PAC Learning
by: Brattka, Vasco, et al.
Published: (2026)
by: Brattka, Vasco, et al.
Published: (2026)
The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
by: Kátay, Tamás, et al.
Published: (2023)
by: Kátay, Tamás, et al.
Published: (2023)
The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
by: Cipriani, Vittorio, et al.
Published: (2022)
by: Cipriani, Vittorio, et al.
Published: (2022)
Hierarchies of Beliefs and Measurable Uniformizations
by: Zoble, Stuart
Published: (2025)
by: Zoble, Stuart
Published: (2025)
Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)
by: Hertling, Peter, et al.
Published: (2023)
Feferman's completeness theorem
by: Pakhomov, Fedor, et al.
Published: (2024)
by: Pakhomov, Fedor, et al.
Published: (2024)
A Lopez-Escobar Theorem for Continuous Domains
by: Bazhenov, Nikolay, et al.
Published: (2023)
by: Bazhenov, Nikolay, et al.
Published: (2023)
Variants of Solovay reducibility
by: Titov, Ivan
Published: (2024)
by: Titov, Ivan
Published: (2024)
Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)
by: Rydval, Jakub
Published: (2021)
Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)
by: Sorg, Christopher
Published: (2026)
NIP and Distal Metric Structures
by: Anderson, Aaron
Published: (2023)
by: Anderson, Aaron
Published: (2023)
Constraint satisfaction problems, compactness and non-measurable sets
by: Tardif, Claude
Published: (2025)
by: Tardif, Claude
Published: (2025)
Forcing Axioms, the Uniformization and the Basis Property
by: Hoffelner, Stefan
Published: (2020)
by: Hoffelner, Stefan
Published: (2020)
Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)
by: Czerwiński, Wojciech, et al.
Published: (2023)
High-arity PAC learning via exchangeability
by: Coregliano, Leonardo N., et al.
Published: (2024)
by: Coregliano, Leonardo N., et al.
Published: (2024)
Forcing the $Π^1_3$-Reduction Property and a Failure of $Π^1_3$-Uniformization
by: Hoffelner, Stefan
Published: (2020)
by: Hoffelner, Stefan
Published: (2020)
From Gödel incompleteness to the consistency of circuit lower bounds
by: Atserias, Albert, et al.
Published: (2026)
by: Atserias, Albert, et al.
Published: (2026)
Extending the Limit Theorem of Barmpalias and Lewis-Pye to all reals
by: Titov, Ivan
Published: (2024)
by: Titov, Ivan
Published: (2024)
Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)
by: Anand, Bhupinder Singh
Published: (2024)
Games, mobile processes, and functionss -- alternating, concurrent, and well-bracketed semantics
by: Jaber, Guilhem, et al.
Published: (2025)
by: Jaber, Guilhem, et al.
Published: (2025)
Similar Items
-
Classifying different criteria for learning algebraic structures
by: Bazhenov, Nikolay, et al.
Published: (2024) -
Learning Equivalence Relations on Polish Spaces
by: Rossegger, Dino, et al.
Published: (2024) -
On the learning power of Friedman-Stanley jumps
by: Cipriani, Vittorio, et al.
Published: (2025) -
The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026) -
Classifying the complexity of models of arithmetic
by: Gonzalez, David, et al.
Published: (2025)