Publications and Research
Document Type
Article
Publication Date
2021
Abstract
This tutorial will introduce listeners to many questions that can be asked about computable processes on fields, and will present the answers that are known, sometimes with proofs. This is not original work. The questions in greatest focus here include decision procedures for the existence of roots of polynomials in specific fields, for the irreducibility of polynomials over those fields, and for transcendence of specific elements over the prime subfield. Several of these questions are related to the construction of algebraic closures, making Rabin's Theorem prominent.
COinS
Comments
This is the author's accepted manuscript of the following article: Miller, Russell. "Computable Procedures for Fields." Connecting with Compautability, CiE 2021, pp 342-352. Part of Lecture Notes in Computer Science.
The final authenticated version is available online at https://doi.org/10.1007/978-3-030-80049-9_31