# Do $PR/Poly$ solve the halting problem of Turing Machine?

I know that $$R/Poly$$ solves the halting problem, as we can have the program that runs for longest time as advice and check which halts earlier. But what if we weaken the $$R$$ into something, like $$PR$$?

• Can you define PR/poly and the halting problem? The exact definitions might matter. – Yuval Filmus Dec 28 '19 at 16:04