The computable-subfield characterization of random infinite extensions
Let be an infinite extension of with no computable subfields of infinite degree over .
Computable-subfield characterization. Then is random.
This conjecture proposes a characterization of random infinite extensions of through the absence of computable subfields of infinite degree. The supplied text does not establish the claim or indicate whether it is resolved.
References
Primary source
Wesley Calvert, Valentina Harizanov and Alexandra Shlapentokh, “Computability in infinite Galois theory and algorithmically random algebraic fields”, arXiv:2312.04741 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.