2019
DOI: 10.1016/j.tcs.2019.09.014
|View full text |Cite
|
Sign up to set email alerts
|

Finite degree clones are undecidable

Abstract: A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky machine M we associate a finitely generated clone C such that C has finite degree if and only if M halts, thus proving that deciding whether a given clone has finite degree is impossible.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…Conversely, Barto proved Valeriote's conjecture [4]: Every finite, finitely related algebra which generates a congruence modular variety has few subpowers. In [14] Moore showed that the question whether a given finite algebra is finitely related is undecidable. As a result, characterizations based on finite relatedness gain greater significance.…”
Section: Introductionmentioning
confidence: 99%
“…Conversely, Barto proved Valeriote's conjecture [4]: Every finite, finitely related algebra which generates a congruence modular variety has few subpowers. In [14] Moore showed that the question whether a given finite algebra is finitely related is undecidable. As a result, characterizations based on finite relatedness gain greater significance.…”
Section: Introductionmentioning
confidence: 99%
“…Moore [13] showed that the question whether a given finite algebra is finitely related is undecidable. This makes characterizations by finite relatedness even more valuable.…”
Section: Introductionmentioning
confidence: 99%