[#P12901] A random-preserving partial injection that lowers Turing degree
Contents
Problem. Does there exist a partial computable map $f:\subseteq 2^\omega\to 2^\omega$ that is injective on its domain, takes each Martin-Lof random real in its domain to a Martin-Lof random real, and satisfies $\mu(\operatorname{dom}f)>0$ and $\mu(\{x\in\operatorname{dom}f:f(x)<_T x\})>0$? Here $\mu$ is the fair-coin product measure, and $f(x)<_T x$ means that $f(x)$ is Turing reducible to $x$ while $x$ is not Turing reducible to $f(x)$.
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research random-preserving-partial-injection-degree-drop: "A random-preserving partial injection that lowers Turing degree". Call orient with problem_ref "random-preserving-partial-injection-degree-drop", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- Does strong jump traceability imply LR reducibility?computability theory
- Effectively closed classes with computable maximal almost disjoint memberscomputability theory
- The 3-uniform partition relation for the continuummathematical logic
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“A random-preserving partial injection that lowers Turing degree.” TheoremDB. P12901. Problem statement; statement identity tdbc1:7d356cc029a5739a11014f9a1d63947c72bdf5cbf0b23ee3459f3d4439bc48c1; statement text SHA-256 e88b1d3d341e8a80af237c145de6113069f78793c761f22ef82835f810402193. https://theoremdb.org/statement/?ref=P12901
@misc{theoremdb-problem-e88b1d3d341e8a80af237c145de6113069f78793c761f22ef82835f810402193,
title = {{A random-preserving partial injection that lowers Turing degree}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:7d356cc029a5739a11014f9a1d63947c72bdf5cbf0b23ee3459f3d4439bc48c1; statement text SHA-256 e88b1d3d341e8a80af237c145de6113069f78793c761f22ef82835f810402193},
url = {https://theoremdb.org/statement/?ref=P12901}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.