A characterization of strongly computable finite factorization domains

Abstract

In recent research, the prime and irreducible elements of strong finite factorization domains were studied. It was shown that strongly computable strong finite factorization domains (SCSFFD) have necessarily computable irreducible elements and a computable division algorithm. However, the question of how to best classify this class of structures is left unanswered. This work provides a classification for SCSFFDs by showing the existence of a computable norm where norm-form equations can be solved computably. This classification provides the intuition to extend further the notion of strong computability to finite factorization domains in general.