Effective enumerations of families of recursive functions

ЗаглавиеEffective enumerations of families of recursive functions
Вид публикацияJournal Article
Година на публикуване2001
АвториDitchev A
СписаниеAnnuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique
Том93
Pagination31-37
ISSN0205-0808
ключови думиstrong recursive sequence, totally recursive function, universal function for a family of recursive functions
Резюме

In this paper necessary and sufficient conditions for a family of finite functions and a family of totally recursive functions to have a universal partially recursive function are given.

2000 MSC

03D20

Прикачен файлРазмер
PDF icon 93-031-037.pdf705.21 KB