scientific article; zbMATH DE number 3622941

From MaRDI portal

Revision as of 12:29, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4185802

Jump to:navigation, search

zbMath0401.68022MaRDI QIDQ4185802

Victor L. Bennison

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity recursively enumerable set arithmetic hierarchy speedability levelability lowness properties jump-operators

Mathematics Subject Classification ID

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

Related Items (2)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4185802&oldid=18020292"