-
which of the following is not primitive recursive but computable ?
which of the following is not primitive recursive but computable ? 1. Carnot function 2. Riemann function 3. Bounded function 4. Ackermann function
-
function f(x) is continuous
The function f(x) is continuous in [0,1], such that f(0)=-1, f(1/2)=1 and f(1)=-1, We can conclude that 1. f attains the value zero at least twice in [0,1] 2. f attains the value zero exactly once in [0,1] 3. f is non-zero in [0,1] 4. f attains the value zero exactly twice in [0,1]