The computable-subfield characterization of random infinite extensions

Let KK be an infinite extension of Q{\mathbb Q} with no computable subfields of infinite degree over Q{\mathbb Q}.

Computable-subfield characterization. Then KK is random.

This conjecture proposes a characterization of random infinite extensions of Q{\mathbb Q} through the absence of computable subfields of infinite degree. The supplied text does not establish the claim or indicate whether it is resolved.

Sources & referencesView supporting material

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.