Completion of choice (Q2220486): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Jeffry L. Hirst / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jeffry L. Hirst / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2982356607 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1910.13186 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 03:31, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Completion of choice |
scientific article |
Statements
Completion of choice (English)
0 references
25 January 2021
0 references
The authors carry out Weihrauch analysis of completions of choice problems in many settings. In general, a choice problem \(C_X\) selects an element from a closed nonempty subset of the space \(X\), where the subset is described by negative information. The completion of a problem \(f\), denoted \(\bar f\), is a total problem that outputs \(f(x)\) if \(x\) is in the domain of \(f\) and the closure of the range space of \(f\) otherwise. The completion of a choice problem may or may not be Weihrauch equivalent to the original problem. For example, \(C_{\mathbb N}\) is not Weihrauch equivalent to \(\overline {C_{\mathbb N}}\), while \(C_{2^{\mathbb N}}\) is Weihrauch equivalent to \(\overline{C_{2^{\mathbb N}}}\). The authors consider choice over many spaces, variations of choice including compact and positive measure versions, totalizations other than completion, and interactions with jump and composition. For a survey of choice problems, see [\textit{V. Brattka} et al., ``Weihrauch complexity in computable analysis'', in Handbook of computability and complexity in analysis. Cham: Springer. 367--417 (2021; \url{doi:10.1007/978-3-030-59234-9_11)}].
0 references
Weihrauch complexity
0 references
computable analysis
0 references
choice problems
0 references
classes of computable problems
0 references
computable reducibility
0 references
Weihrauch reducibility
0 references
total Weihrauch reducibility
0 references
Weihrauch lattice
0 references
completion
0 references
totalization
0 references