About high

In computability theory, a Turing degree [X] is high if it is computable in 0′, and the Turing jump [X′] is 0′′, which is the greatest possible degree in terms of Turing reducibility for the jump of a set which is computable in 0′.

members

here now

Everything about high →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

high

term in computability theory

0members1here now

Ask Genius Site

Site Journal

Not who you're looking for? Others named high: 1997 album by Flotsam and Jetsam · a play written by Matthew Lombardo · Peking Duk song · album by Jarryd James

Feed Discussions About

Comments

Ask Genius by OpenServe:

Free account · your comment posts right after signup

About high

members

here now

Everything about high →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

Not who you're looking for? Others named high: 1997 album by Flotsam and Jetsam · a play written by Matthew Lombardo · Peking Duk song · album by Jarryd James