KFU. Card publication. Marat M. Arslanov, Steffen Lempp, eds. Recursion Theory and Complexity.

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

MARAT M. ARSLANOV, STEFFEN LEMPP, EDS. RECURSION THEORY AND COMPLEXITY.

Form of presentation

International monographs

Year of publication

1999

Authors, employees of KFU

Arslanov Marat Mirzaevich, author

Other authors

Lempp Steffen

Bibliographic description in the original language

Marat M. Arslanov, Steffen Lempp, eds. Recursion Theory and Complexity, de Gruyter Series in Logic and Its Applications. Proceedings of the Kazan'97 Workshop, Kazan, Russia, July 14-19, 1997. Walter de Gruyter, Berlin, New York, 1999.

Annotation

Proceedings of the Kazan'97 Worskhop, Kazan, Russia, July 14-19, 1997

Keywords

вычислимые и невычислимые функции, машины Тьюринга, степени неразрешимости, сводимости по Тбрингу, сводимости по перечислимости

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=78715&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Arslanov Marat Mirzaevich	ru_RU
dc.date.accessioned	1999-01-01T00:00:00Z	ru_RU
dc.date.available	1999-01-01T00:00:00Z	ru_RU
dc.date.issued	1999	ru_RU
dc.identifier.citation	Marat M. Arslanov, Steffen Lempp, eds. Recursion Theory and Complexity, de Gruyter Series in Logic and Its Applications. Proceedings of the Kazan'97 Workshop, Kazan, Russia, July 14-19, 1997. Walter de Gruyter, Berlin, New York, 1999.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=78715&p_lang=2	ru_RU
dc.description.abstract	Proceedings of the Kazan'97 Worskhop, Kazan, Russia, July 14-19, 1997	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	вычислимые и невычислимые функции	ru_RU
dc.subject	машины Тьюринга	ru_RU
dc.subject	степени неразрешимости	ru_RU
dc.subject	сводимости по Тбрингу	ru_RU
dc.subject	сводимости по перечислимости	ru_RU
dc.title	Marat M. Arslanov, Steffen Lempp, eds. Recursion Theory and Complexity.	ru_RU
dc.type	International monographs	ru_RU