О классах алгоритмов, сохраняющих отношения

Ю.В. Голунков

Verojatnostnye metody i kibernetika (1982)

  • Volume: 18, page 26-36
  • ISSN: 0132-2869

How to cite

top

Голунков, Ю.В.. "О классах алгоритмов, сохраняющих отношения." Verojatnostnye metody i kibernetika 18 (1982): 26-36. <http://eudml.org/doc/69207>.

@article{Голунков1982,
author = {Голунков, Ю.В.},
journal = {Verojatnostnye metody i kibernetika},
keywords = {algorithmic completeness; completeness problem; systems of algorithmic algebras of graph-schemes of algorithms with memory; maximal subalgebras of precomplete classes},
language = {rus},
pages = {26-36},
publisher = {Izd. Kazanskogo universiteta},
title = {О классах алгоритмов, сохраняющих отношения},
url = {http://eudml.org/doc/69207},
volume = {18},
year = {1982},
}

TY - JOUR
AU - Голунков, Ю.В.
TI - О классах алгоритмов, сохраняющих отношения
JO - Verojatnostnye metody i kibernetika
PY - 1982
PB - Izd. Kazanskogo universiteta
VL - 18
SP - 26
EP - 36
LA - rus
KW - algorithmic completeness; completeness problem; systems of algorithmic algebras of graph-schemes of algorithms with memory; maximal subalgebras of precomplete classes
UR - http://eudml.org/doc/69207
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.