- #1
Bedrich
- 6
- 1
Hello, I am stuck on deciding if given sets are recursive or recursively enumerable and why. Those sets are:
set ƒ(A) = {y, ∃ x ∈ A ƒ(x) = y}
and the second is
set ƒ-1(A) = {x, ƒ(x) ∈ A}
where A is a recursive set and ƒ : ℕ → ℕ is a computable function.
I am new to computability theory and any advice would be highly appreciated.
set ƒ(A) = {y, ∃ x ∈ A ƒ(x) = y}
and the second is
set ƒ-1(A) = {x, ƒ(x) ∈ A}
where A is a recursive set and ƒ : ℕ → ℕ is a computable function.
I am new to computability theory and any advice would be highly appreciated.