{"version":"1.0","type":"link","title":"Turing reduction - Newikis","description":"In computability theory, a Turing reduction from a decision problem to a decision problem is an oracle machine that decides problem given an oracle for (Rogers 1967, Soare 1987) in finitely many steps. It can be understood as an algorithm that could be used to solve if it had access to a subroutine…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}