Effective enumerations of families of recursive functions

Authors

  • Angel Ditchev

Keywords:

strong recursive sequence, totally recursive function, universal function for a family of recursive functions

Abstract

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.

Downloads

Published

2001-12-12

Issue

Vol. 93 (2001): Ann. Sofia Univ. Fac. Math and Inf.

Section

Articles

How to Cite

Effective enumerations of families of recursive functions. (2001). Annual of Sofia University St. Kliment Ohridski. Faculty of Mathematics and Informatics, 93, 31-37. https://annual.uni-sofia.bg/index.php/fmi/article/view/200