Activity for Derek Elkins‭

Type	On...	Excerpt	Status	Date
Answer	—	A: Computational hardness of the uniform halting problem According to Wikipedia, the set of (indices of) Turing machines that compute total functions, i.e. which halt on all inputs, is a $\Pi2$ set. If we use the variation of the definition of arithmetical hierarchy which includes primitive recursive functions, then it is fairly straightforward^[If you are... (more)	—	about 4 years ago

• ← Previous
• 1
• 2
• 3
• 4
• 5
• Next →