Corpus ID: 232013713

Stashing And Parallelization Pentagons

@inproceedings{Brattka2021StashingAP,
  title={Stashing And Parallelization Pentagons},
  author={Vasco Brattka},
  year={2021}
}
Parallelization is an algebraic operation that lifts problems to sequences in a natural way. Given a sequence as an instance of the parallelized problem, another sequence is a solution of this problem if every component is instance-wise a solution of the original problem. In the Weihrauch lattice parallelization is a closure operator that corresponds to the bang operator in linear logic. Here we introduce a dual operation that we call stashing and that also lifts problems to sequences, but such… Expand

Figures from this paper

References

SHOWING 1-10 OF 34 REFERENCES
WEIHRAUCH GOES BROUWERIAN
Abstract We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and thenExpand
Weihrauch degrees, omniscience principles and weak computability
TLDR
It is proved that parallelized LLPO is equivalent to Weak Kőnig's Lemma and hence to the Hahn–Banach Theorem in this new and very strong sense and any single-valued weakly computable operation is already computable in the ordinary sense. Expand
The Discontinuity Problem
TLDR
The discontinuity problem is introduced, and it is shown that it is reducible exactly to the effectively discontinuous problems, defined in a suitable way. Expand
On the algebraic structure of Weihrauch degrees
TLDR
A function space of multi-valued continuous functions that turns out to be particularly well-behaved for effectively traceable spaces that are closely related to admissibly represented spaces is introduced and studied. Expand
On the Uniform Computational Content of the Baire Category Theorem
TLDR
This work distinguishes two different logical versions of the Baire Category Theorem, where one can be seen as the contrapositive form of the other one, and considers different ways how the sequence of closed sets is given, which can distinguish between positive and negative information on closed sets. Expand
The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma
TLDR
The concept of a derivative or jump in this lattice is introduced and it is shown that the Bolzano–Weierstras Theorem on real numbers is the jump of Weak Kőnig’s Lemma and the Monotone Convergence Theorem. Expand
Joins in the strong Weihrauch degrees
  • D. Dzhafarov
  • Computer Science, Mathematics
  • Mathematical Research Letters
  • 2019
TLDR
This work answers an open question about the algebraic structure of the strong Weihrauch degrees, by exhibiting a join operation that turns these degrees into a lattice, and shows that the two structures are not isomorphic. Expand
Probabilistic computability and choice
TLDR
This work introduces the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a probabilistic Turing machine that receives a random binary sequence as auxiliary input and proves an Independent Choice Theorem that implies that Las Vegas Computable functions are closed under composition. Expand
Game Characterizations and Lower Cones in the Weihrauch Degrees
TLDR
A parametrized version of the Wadge game for functions is introduced and it is proposed that the lower cones in the Weihrauch degrees are the answer to Andretta's question on which classes of functions admit game characterizations. Expand
Degrees of unsolvability of continuous functions
TLDR
It is shown that the Turing degrees are not sufficient to measure the complexity of continuous functions on [0, 1], and the continuous degrees are introduced and proved to be a proper extension of the Turing degree and a proper substructure of the enumeration degrees. Expand
...
1
2
3
4
...