Skip to search formSkip to main contentSkip to account menu

Hyperarithmetical theory

Known as: Hyperarithmetical, Hyperarithmetical set, Hyperarithmetic hierarchy 
In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The hypervolume indicator (HYP) is a popular measure for the quality of a set of <i>n</i> solutions in ℜR<i><sup>d</sup></i>. We… 
2012
2012
In recent years there has been an increasing interest in using high-yield pulp (HYP) as a partial replacement for hardwood… 
2010
2010
We report on the measurement of the static potential and the scale r_0 from HYP-smeared Wilson loops in two flavour QCD. We… 
2009
2009
If $\mathcal{L}$ is a finite relational language then all computable $\mathcal{L}$-structures can be effectively enumerated in a… 
2008
2008
Two typical high-yield pulps (HYPs) used in wood-free paper grades, aspen HYP and birch HYP, were investigated for their effects… 
2003
2003
We investigate the computational complexity the class of Γ‐categorical computable structures. We show that hyperarithmetic… 
2002
2002
We study the locality and topological properties of fat link clover overlap (FCO) actions. We find that a small amount of… 
1997
1997
A method for computing inviscid hypersonic flow over complex configurations using unstructured meshes is presented. The… 
1994
1994
SummaryWe prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can…