# Stashing And Parallelization Pentagons

@article{Brattka2021StashingAP, title={Stashing And Parallelization Pentagons}, author={Vasco Brattka}, journal={Logical Methods in Computer Science}, 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. Here we introduce a dual operation that
we call stashing and that also lifts problems to sequences, but such that only
some component has to be an instance-wise…

## References

SHOWING 1-10 OF 55 REFERENCES

WEIHRAUCH GOES BROUWERIAN

- Computer Science, MathematicsThe Journal of Symbolic Logic
- 2020

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 then…

Weihrauch degrees, omniscience principles and weak computability

- Computer Science, MathematicsThe Journal of Symbolic Logic
- 2011

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.

The Discontinuity Problem

- Computer Science, MathematicsThe Journal of Symbolic Logic
- 2022

The discontinuity problem is introduced, and it is shown that it is reducible exactly to the effectively discontinuous problems, defined in a suitable way.

The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma

- Mathematics, Computer ScienceAnn. Pure Appl. Log.
- 2012

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.

On the algebraic structure of Weihrauch degrees

- Mathematics, Computer ScienceLog. Methods Comput. Sci.
- 2018

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.

On the Uniform Computational Content of the Baire Category Theorem

- Computer Science, MathematicsNotre Dame J. Formal Log.
- 2018

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.

Joins in the strong Weihrauch degrees

- Computer Science, MathematicsMathematical Research Letters
- 2019

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.

Game Characterizations and Lower Cones in the Weihrauch Degrees

- Mathematics, Computer ScienceCiE
- 2017

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.

Probabilistic computability and choice

- Computer Science, MathematicsInf. Comput.
- 2015

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.

On the Uniform Computational Content of Computability Theory

- Mathematics, Computer ScienceTheory of Computing Systems
- 2017

It is demonstrated that the Weihrauch lattice can be used to classify the uniform computationalcontent of computability-theoretic properties as well as the computational content of theorems in one common setting and a bridge between the indiscriminative world and the discriminative World of classical mathematics can be established via a suitable residual operation.