Слабо рекурсивно перечилимые степени и предельная вычислимость

М.М. Арсланов

Verojatnostnye metody i kibernetika (1979)

  • Volume: 15, page 3-9
  • ISSN: 0132-2869

How to cite

top

Арсланов, М.М.. "Слабо рекурсивно перечилимые степени и предельная вычислимость." Verojatnostnye metody i kibernetika 15 (1979): 3-9. <http://eudml.org/doc/69175>.

@article{Арсланов1979,
author = {Арсланов, М.М.},
journal = {Verojatnostnye metody i kibernetika},
keywords = {computability in the limit; Turing degree; degree of complexity; degree of unsolvability},
language = {rus},
pages = {3-9},
publisher = {Izd. Kazanskogo universiteta},
title = {Слабо рекурсивно перечилимые степени и предельная вычислимость},
url = {http://eudml.org/doc/69175},
volume = {15},
year = {1979},
}

TY - JOUR
AU - Арсланов, М.М.
TI - Слабо рекурсивно перечилимые степени и предельная вычислимость
JO - Verojatnostnye metody i kibernetika
PY - 1979
PB - Izd. Kazanskogo universiteta
VL - 15
SP - 3
EP - 9
LA - rus
KW - computability in the limit; Turing degree; degree of complexity; degree of unsolvability
UR - http://eudml.org/doc/69175
ER -

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.