Estimation of the algorithmic complexity of classes of computable models.

Pavlovskij, E.N.

Sibirskij Matematicheskij Zhurnal (2008)

  • Volume: 49, Issue: 3, page 635-649
  • ISSN: 0037-4474

How to cite

top

Pavlovskij, E.N.. "Estimation of the algorithmic complexity of classes of computable models.." Sibirskij Matematicheskij Zhurnal 49.3 (2008): 635-649. <http://eudml.org/doc/55574>.

@article{Pavlovskij2008,
author = {Pavlovskij, E.N.},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {computable model; index set},
language = {eng},
number = {3},
pages = {635-649},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {Estimation of the algorithmic complexity of classes of computable models.},
url = {http://eudml.org/doc/55574},
volume = {49},
year = {2008},
}

TY - JOUR
AU - Pavlovskij, E.N.
TI - Estimation of the algorithmic complexity of classes of computable models.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2008
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 49
IS - 3
SP - 635
EP - 649
LA - eng
KW - computable model; index set
UR - http://eudml.org/doc/55574
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.