Computing Roots of Unity in Fields

DOI10.1112/blms/12.6.463zbMath0448.03032OpenAlexW2017738652MaRDI QIDQ3893914

Viggo Stoltenberg-Hansen, J. V. Tucker

Publication date: 1980

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/12.6.463

zbMATH Keywords

decision problemscomputable fieldcomputable algebrarecursively enumerable Turing degreecomputable abelian group

Mathematics Subject Classification ID

Decidability and field theory (12L05) Undecidability and degrees of sets of sentences (03D35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Applications of computability and recursion theory (03D80) Torsion groups, primary groups and generalized primary groups (20K10) Theory of numerations, effectively presented structures (03D45) Abelian groups (20K99)

Related Items (1)

Ideals in computable rings

This page was built for publication: Computing Roots of Unity in Fields