Let be a Register Machine and We define the following sets , , Proposition These sets are computable. Proof Only prove for last one, because it is the most complicated.