Weihrauch reducibility: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 19:4619:46, 13 July 2024 Manoomin talk contribs 3,873 bytes +68 Corrected Weihrauch TR citation with the correct publisher/repository (FernUniversität in Hagen), matching the text of the TR and the way Weihrauch himself later cited it. undo

curprev 00:5200:52, 6 January 2024 OAbot talk contribs m 3,805 bytes +18 Open access bot: arxiv updated in citation with #oabot. undo

curprev 09:3709:37, 1 February 2023 Citation bot talk contribs 3,787 bytes +17 Add: s2cid, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 1586/3500 undo

curprev 12:5512:55, 28 June 2022 Vmanlio talk contribs 3,391 bytes +38 No edit summary undo
curprev 12:4712:47, 28 June 2022 Vmanlio talk contribs 3,353 bytes +142 Submitting using AfC-submit-wizard undo
curprev 12:4612:46, 28 June 2022 Vmanlio talk contribs 3,211 bytes +29 No edit summary undo
curprev 11:2811:28, 28 June 2022 Vmanlio talk contribs 3,182 bytes +3,182 ←Created page with '{{subst:AfC submission/draftnew}} Weihrauch reducibility is a notion of reducibility between multi-valued functions on represented spaces that roughly captures the uniform computational strength of computational problems. It was originally introduced in <ref>{{cite report |title=The Degrees of Discontinuity of some Translators between Representations of the Real Numbers |publisher=...'