Upper bounds on ideals in the computably enumerable Turing degrees.
George BarmpaliasAndré NiesPublished in: Ann. Pure Appl. Log. (2011)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- inductive inference
- lower and upper bounds
- machine intelligence
- vc dimension
- partial order
- branch and bound
- hypothesis space
- tight bounds
- turing machine
- partially ordered
- sample size
- artificial intelligence
- error probability
- generalization error
- permutation flowshop
- data sets
- np hard
- computational complexity
- neural network