Approximability of deep computations
Fuente:
arXiv
Saved in:
| Main Authors: | Alva, Samson, Dueñez, Eduardo, Iovino, Jose, Walton, Claire |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Complexity of deep computations via topology of function spaces
by: Dueñez, Eduardo, et al.
Published: (2026)
by: Dueñez, Eduardo, et al.
Published: (2026)
Hallucination, abstention, and computable inseparability
by: Imamura, Takuma
Published: (2026)
by: Imamura, Takuma
Published: (2026)
The magic of tensor products of ultrafilters
by: Di Nasso, Mauro
Published: (2025)
by: Di Nasso, Mauro
Published: (2025)
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)
Initial Tukey structure below a stable ordered-union ultrafilter
by: Özalp, Tan
Published: (2024)
by: Özalp, Tan
Published: (2024)
Random expansions of trees with bounded height
by: Koponen, Vera, et al.
Published: (2024)
by: Koponen, Vera, et al.
Published: (2024)
Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization
by: Boche, Holger, et al.
Published: (2024)
by: Boche, Holger, et al.
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)
SAD Neural Networks: Divergent Gradient Flows and Asymptotic Optimality via o-minimal Structures
by: Kranz, Julian, et al.
Published: (2025)
by: Kranz, Julian, et al.
Published: (2025)
Infinite Eulerian paths are computable on graphs with vertices of infinite degree
by: Carrasco-Vargas, Nicanor
Published: (2023)
by: Carrasco-Vargas, Nicanor
Published: (2023)
Bounded Ramsey's theorem for triples in computability theory
by: Patey, Ludovic, et al.
Published: (2026)
by: Patey, Ludovic, et al.
Published: (2026)
$Ψ$-Spaces and Semi-Proximality
by: Almontashery, Khulod, et al.
Published: (2024)
by: Almontashery, Khulod, et al.
Published: (2024)
Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
by: Kratsios, Anastasis, et al.
Published: (2026)
by: Kratsios, Anastasis, et al.
Published: (2026)
Divisibility classes of ultrafilters and their patterns
by: Šobot, Boris
Published: (2024)
by: Šobot, Boris
Published: (2024)
A survey on divisibility of ultrafilters
by: Šobot, Boris
Published: (2024)
by: Šobot, Boris
Published: (2024)
$\widetilde{\mid}\hspace{1mm}$-divisibility of ultrafilters II: The big picture
by: Šobot, Boris
Published: (2023)
by: Šobot, Boris
Published: (2023)
Learning Equivalence Relations on Polish Spaces
by: Rossegger, Dino, et al.
Published: (2024)
by: Rossegger, Dino, et al.
Published: (2024)
Semi-proximal spaces and normality
by: Almontashery, Khulod, et al.
Published: (2023)
by: Almontashery, Khulod, et al.
Published: (2023)
Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)
by: Sorg, Christopher
Published: (2026)
Measurability in the Fundamental Theorem of Statistical Learning
by: Krapp, Lothar Sebastian, et al.
Published: (2024)
by: Krapp, Lothar Sebastian, et al.
Published: (2024)
Ramsey's coheirs
by: Colla, Eugenio, et al.
Published: (2019)
by: Colla, Eugenio, et al.
Published: (2019)
Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)
by: Rydval, Jakub
Published: (2021)
A new ultrafilter proof of Van der Waerden's theorem
by: Di Nasso, Mauro
Published: (2026)
by: Di Nasso, Mauro
Published: (2026)
Hierarchies of direct powers, ultrapowers and cumulative powers
by: Yago, Pedro Teixeira
Published: (2026)
by: Yago, Pedro Teixeira
Published: (2026)
Paths, Ends and The Separation Problem for Infinite Graphs
by: Carrasco-Vargas, Nicanor, et al.
Published: (2024)
by: Carrasco-Vargas, Nicanor, et al.
Published: (2024)
Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)
by: Tang, Jian-Gang
Published: (2022)
Extending orders to types
by: Baglini, Lorenzo Luperi, et al.
Published: (2025)
by: Baglini, Lorenzo Luperi, et al.
Published: (2025)
Self-divisible ultrafilters and congruences in $β\mathbb{Z}$
by: Di Nasso, Mauro, et al.
Published: (2023)
by: Di Nasso, Mauro, et al.
Published: (2023)
Random expansions of finite structures with bounded degree
by: Koponen, Vera
Published: (2024)
by: Koponen, Vera
Published: (2024)
Degree-preserving graph dynamics -- a versatile process to construct random networks
by: Erdős, Péter L., et al.
Published: (2021)
by: Erdős, Péter L., et al.
Published: (2021)
Quantum Random Self-Modifiable Computation
by: Fiske, Michael Stephen
Published: (2018)
by: Fiske, Michael Stephen
Published: (2018)
Formalising New Mathematics in Isabelle: Diagonal Ramsey
by: Paulson, Lawrence C
Published: (2025)
by: Paulson, Lawrence C
Published: (2025)
On sequential structures in incompressible multidimensional networks
by: Abrahão, Felipe S., et al.
Published: (2018)
by: Abrahão, Felipe S., et al.
Published: (2018)
Choiceless Polynomial Space
by: Ferrarotti, Flavio, et al.
Published: (2024)
by: Ferrarotti, Flavio, et al.
Published: (2024)
On Chaitin's Heuristic Principle and Halting Probability
by: Salehi, Saeed
Published: (2023)
by: Salehi, Saeed
Published: (2023)
Ramsey's witnesses
by: Di Nasso, Mauro, et al.
Published: (2025)
by: Di Nasso, Mauro, et al.
Published: (2025)
Regressive versions of Hindman's Theorem
by: Carlucci, Lorenzo, et al.
Published: (2022)
by: Carlucci, Lorenzo, et al.
Published: (2022)
The reverse mathematics of bounded Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2025)
by: Houérou, Quentin Le, et al.
Published: (2025)
Computability of Separation Axioms in Countable Second Countable Spaces
by: DeLapo, Andrew, et al.
Published: (2025)
by: DeLapo, Andrew, et al.
Published: (2025)
Weak, strong and mixed extensions of relations to spaces of ultrafilters
by: Gasparro, Leonardo Raffaello Maximilian, et al.
Published: (2025)
by: Gasparro, Leonardo Raffaello Maximilian, et al.
Published: (2025)
Similar Items
-
Complexity of deep computations via topology of function spaces
by: Dueñez, Eduardo, et al.
Published: (2026) -
Hallucination, abstention, and computable inseparability
by: Imamura, Takuma
Published: (2026) -
The magic of tensor products of ultrafilters
by: Di Nasso, Mauro
Published: (2025) -
Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
by: Kattermann, David, et al.
Published: (2025) -
Initial Tukey structure below a stable ordered-union ultrafilter
by: Özalp, Tan
Published: (2024)