Important Notice: Our web hosting provider recently started charging us for additional visits, which was unexpected. In response, we're seeking donations. Depending on the situation, we may explore different monetization options for our Community and Expert Contributors. It's crucial to provide more returns for their expertise and offer more Expert Validated Answers or AI Validated Answers. Learn more about our hosting issue here.

I think there exists an effiecitve enumeration of all total recursive functions, since all deciders are coutable –AM I right?

April 26, 2017enumeration exists functions Recursive right think total

0

Posted

I think there exists an effiecitve enumeration of all total recursive functions, since all deciders are coutable –AM I right?

1 Answer

0

Posted

Since the set of recursive functions is countable, there is an enumeration.