Login / Signup
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable.
Klaus Ambos-Spies
André Nies
Published in:
STACS (1992)
Keyphrases
</>
theoretical framework
set theoretic
datalog programs
sufficient conditions
computational model
algebraic geometry
theoretical basis
formal theory
data sets
genetic algorithm
artificial intelligence
decision trees
image sequences
knowledge representation
definite clause