Main conjecture on computable functions on the space of marked groups
Statement
Let be the space of marked groups with solvable word problem, equipped with its computability structure, and let denote the corresponding representation. A function is -computable when it is computable relative to this representation; a recursive metric space is a metric space with effective computable structure.
Main conjecture. Any -computable function defined on , with image in any recursive metric space, is continuous.
The paper explains that standard effective continuity theorems do not apply to , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.