ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GWP\mathcal{G}_{WP} be the space of marked groups with solvable word problem, equipped with its computability structure, and let ΛWP\Lambda_{WP} denote the corresponding representation. A function is ΛWP\Lambda_{WP}-computable when it is computable relative to this representation; a recursive metric space is a metric space with effective computable structure.

Main conjecture. Any ΛWP\Lambda_{WP}-computable function defined on GWP\mathcal{G}_{WP}, with image in any recursive metric space, is continuous.

The paper explains that standard effective continuity theorems do not apply to GWP\mathcal{G}_{WP}, while known examples of computable discontinuous functions on recursive metric spaces are pathological. Whether every computable function in this setting is continuous remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.