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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Evolutionary diversity optimization aims to compute a set of solutions that are diverse in the search space or instance feature… 
Highly Cited
2010
Highly Cited
2010
We present results for kaon mixing parameter BK calculated using HYP-smeared improved staggered fermions on the MILC asqtad… 
2010
2010
The overlap fermion propagator is calculated on 2+1 flavor domain-wall fermion gauge configurations on 16{sup 3}x32, 24{sup 3}x64… 
2008
2008
This document reports on work undertaken at DSTO towards modelling the mean ocean backscatter coefficient at low to medium… 
Highly Cited
2003
Highly Cited
2003
Inverse weighted distance and regression nonexact techniques were evaluated for interpolating methods snow water equivalent (SWE… 
Review
2002
Review
2002
Generating minimal transversals of a hypergraph is an important problem which has many applications in Computer Science. In the… 
Highly Cited
2000
Highly Cited
1987
Highly Cited
1987
  • C. Ash
  • Ann. Pure Appl. Log.
  • 1987
  • Corpus ID: 28693908
Highly Cited
1984
Highly Cited
1984
In this paper we introduce a new hierarchy of sets and operators which we call the REA hierarchy for “recursively enumerable in…