On classifying subsets of natural numbers by their computable permutations.
Sibirskij Matematicheskij Zhurnal (2004)
- Volume: 45, Issue: 1, page 150-163
- ISSN: 0037-4474
Access Full Article
top
How to cite
topCombarro, E.F.. "On classifying subsets of natural numbers by their computable permutations.." Sibirskij Matematicheskij Zhurnal 45.1 (2004): 150-163. <http://eudml.org/doc/51247>.
@article{Combarro2004,
author = {Combarro, E.F.},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {computable permutation; automorphism; computably enumerable set; computable set; recursive set},
language = {eng},
number = {1},
pages = {150-163},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {On classifying subsets of natural numbers by their computable permutations.},
url = {http://eudml.org/doc/51247},
volume = {45},
year = {2004},
}
TY - JOUR
AU - Combarro, E.F.
TI - On classifying subsets of natural numbers by their computable permutations.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2004
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 45
IS - 1
SP - 150
EP - 163
LA - eng
KW - computable permutation; automorphism; computably enumerable set; computable set; recursive set
UR - http://eudml.org/doc/51247
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.