Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets (Q4337649)

From MaRDI portal
Revision as of 08:56, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1012886
Language Label Description Also known as
English
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
scientific article; zbMATH DE number 1012886

    Statements

    Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets (English)
    0 references
    0 references
    0 references
    26 May 1997
    0 references
    unambiguous computation
    0 references
    Boolean hierarchy
    0 references
    sparse Turing-complete sets
    0 references

    Identifiers