scientific article; zbMATH DE number 3622941

MaRDI QIDQ4185802zbMATH OpenFDO

Authors Victor L. Bennison

Publication date 1979

zbMATH Keywords

computational complexityrecursively enumerable setspeedabilityarithmetic hierarchylevelabilitylowness propertiesjump-operators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursively (computably) enumerable sets and degrees (03D25) Complexity of computation (including implicit computational complexity) (03D15)

Cited in

(2)

• On speedable and levelable vector spaces
• On self-reducibility and weak P-selectivity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4185802)