The Gamified Katětov order embeds P(ω)/Fin, yielding antichains of size continuum and new non-modest degrees in the extended Weihrauch hierarchy.
Weihrauch complexity in computable analysis , url =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Primitive recursion admits equivalent characterizations via bounded ReLU iteration, robust polynomial ODEs, and step-size-parameterized polynomial maps, with composition emerging from the dynamics.
A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.
citing papers explorer
-
The Gamified Kat\v{e}tov order is not linear (in fact, very much not so)
The Gamified Katětov order embeds P(ω)/Fin, yielding antichains of size continuum and new non-modest degrees in the extended Weihrauch hierarchy.
-
Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
Primitive recursion admits equivalent characterizations via bounded ReLU iteration, robust polynomial ODEs, and step-size-parameterized polynomial maps, with composition emerging from the dynamics.
-
What can Topology tell us about Logical Complexity?
A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.