Increasing Computability

Computer Science Level 3

Suppose f : N → N f : \mathbb{N} \to \mathbb{N} is a totally computable function which is non-decreasing, that is f ( n ) ≤ f ( n + 1 ) f(n) \leq f(n+1) .

When is Range ( f ) \text{Range}(f) computable?

In neither case When Range ( f ) \text{Range}(f) is infinite When Range ( f ) \text{Range}(f) is finite Always

Agnishom Chattopadhyay by Agnishom Chattopadhyay , 22, India

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Frisk Dreemurr
Jul 19, 2020

As it never decreases, it can only increase.

Regardless of whether it approaches infinite or not, it is still computable

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...