On classifying subsets of natural numbers by their computable permutations

被引：0

作者：

Combarro, EF

机构：

[1] University of Oviedo,

来源：

SIBERIAN MATHEMATICAL JOURNAL | 2004年 / 45卷 / 01期

关键词：

computable permutation; automorphism; computable set; recursive set; enumerable set;

D O I：

10.1023/B:SIMJ.0000013017.38330.2b

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We introduce some alternative definitions of the concept of computable automorphism of a set of natural numbers. We study their relationships and investigate whether some classes of sets having isomorphic groups of automorphisms coincide with other classes of sets usual in computability. Finally, we show that the classification of sets by these groups of automorphisms is nontrivial.

引用

页码：125 / 135

页数：11