We study the complexity of the computational task ``Given a colouring c : Q → k, find a monochromatic S ⊆ Q such that (S,<) (Q,<)''. The framework is Weihrauch reducibility. Our results answer some open questions recently raised by Gill, and by Dzhafarov, Solomon and Valenti.
No takes yet. Share an insight, caveat, or question.
Arno Pauly (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: