reducibility การใช้

• Type theory is chiefly interested in the convertibility or reducibility of programs.
• The most well known are arithmetical reducibility and hyperarithmetical reducibility.
• The most well known are arithmetical reducibility and hyperarithmetical reducibility.
• The study of reducibility notions is motivated by the study of decision problems.
• The Turing degrees are partially ordered by Turing reducibility.
• One method is based on the difference in the reducibility between the two tetrahalides.
• The most fundamental reducibility notion is Turing reducibility.
• The most fundamental reducibility notion is Turing reducibility.
• This reducibility part of the work was independently double checked with different programs and computers.
• An ongoing area of research in recursion theory studies reducibility relations other than Turing reducibility.
• An ongoing area of research in recursion theory studies reducibility relations other than Turing reducibility.
• To escape this outcome, Russell postulated his " axiom of reducibility ".
• Decision problems can be ordered according to NP of decision problems under polynomial-time reducibility.
• The second part asserts the complete reducibility of unitary representations of " G ".
• In 1944 Emil Post used the term " Turing reducibility " to refer to the concept.
• The degrees of any reducibility relation are partially ordered by the relation in the following manner.
• This reducibility is, essentially, a resource-bounded version of many-one reducibility.
• This reducibility is, essentially, a resource-bounded version of many-one reducibility.
• The relativized hyperarithmetical hierarchy is used to define "'hyperarithmetical reducibility " '.
• Post also showed that some of them are strictly intermediate under other reducibility notions stronger than Turing reducibility.