Jump complexity of term-by-term root taking in Hahn fields
Statement
Let be an algebraically closed field of characteristic 0, and let be an ordered divisible group. Consider the Hahn field, defined as follows:
If and are computable and , how complex is it to determine a root of ? At each step, the procedure should produce the next term in a root of , based on the in the input coefficients of . For each step , how many jumps over these coefficients are needed to do step ?
Record
- Source
- Added
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.