Low (computability)
id:
low-computability-292-8507204
title:
Low (computability)
text:
In computability theory, a Turing degree [X] is low if the Turing jump [X′] is 0′. A set is low if it has low degree. Since every set is computable from its jump, any low set is computable in 0′, but the jump of sets computable in 0′ can bound any degree recursively enumerable in 0′. X being low says that its jump X′ has the least possible degree in terms of Turing reducibility for the jump of a set. There are various related properties to low degrees: A degree is lown if its n'th jump is the n'
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Low_(computability)
date created:
date modified:
2023-05-04T10:55:57Z
main entity:
{"identifier":"Q6692805","url":"https://www.wikidata.org/entity/Q6692805"}
image:
fields total:
13
integrity:
13