On Classifying Subsets of Natural Numbers by Their Computable Permutations

ISSN： 0037-4466

Source： Siberian Mathematical Journal, Vol.45, Iss.1, 2004-01, pp. : 125-135

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Numbers of Orbits of Permutations under an Operator Related to Eulerian Numbers

By Tanimoto Shinji

Annals of Combinatorics, Vol. 8, Iss. 2, 2004-07 ,pp. : 239-250

Springer Publishing Company

Access to resources Recommend Favorite

On the hierarchy and extension of monotonically computable real numbers

By Rettinger R. Zheng X.

Journal of Complexity, Vol. 19, Iss. 5, 2003-10 ,pp. : 672-691

Elsevier

Access to resources Recommend Favorite

A Σ-Set of Natural Numbers Not Enumerable by Natural Numbers

By Morozov A.S.

Siberian Mathematical Journal, Vol. 41, Iss. 6, 2000-11 ,pp. : 1162-1165

Springer Publishing Company

Access to resources Recommend Favorite

Complexity of some natural problems on the class of computable I-algebras

By Kogabaev N.

Siberian Mathematical Journal, Vol. 47, Iss. 2, 2006-03 ,pp. : 291-297

Springer Publishing Company

Access to resources Recommend Favorite

On Ordering the Natural Numbers or The Sharkovski Theorem

By Ciesielski Krzysztof Pogoda Zdzisław

American Mathematical Monthly, Vol. 115, Iss. 2, 2008-02 ,pp. : 159-165

Mathematical Association of America

Access to resources Recommend Favorite