Universal computable enumerations of finite classes of families of total functions

详细信息    查看全文

• 作者：M. Kh. Faizrakhmanov
• 关键词：computable enumeration ; universal enumeration ; class of families ; arithmetical enumeration
• 刊名：Russian Mathematics
• 出版年：2016
• 出版时间：December 2016
• 年：2016
• 卷：60
• 期：12
• 页码：79-83
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics, general;
• 出版者：Allerton Press
• ISSN：1934-810X
• 卷排序：60

文摘

In the paper we introduce the notion of a computable enumeration of a class of families. We prove a criteria for the existence of universal computable enumerations of finite classes of computable families of total functions. In particular, we show that there is a finite computable class of families of total functions without universal computable enumerations.