Computational completeness of equations over sets of natural numbers (Q2252522)

From MaRDI portal
Revision as of 19:12, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational completeness of equations over sets of natural numbers
scientific article

    Statements

    title
    Computational completeness of equations over sets of natural numbers (English)
    0 references
    author
    Artur Jeż
    0 references
    Alexander Okhotin
    0 references
    publication date
    18 July 2014
    0 references
    zbMATH DE Number
    6318225
    0 references
    zbMATH Keywords
    language equations
    0 references
    unary languages
    0 references
    computability
    0 references
    OpenAlex ID
    W2086162968
    0 references
    cites work
    Q4525271
    0 references
    Automatic Sequences
    0 references
    Q5639639
    0 references
    Q5583856
    0 references
    Q4256623
    0 references
    Q3992465
    0 references
    Q4531380
    0 references
    Q5192986
    0 references
    Q2893311
    0 references
    Q5573961
    0 references
    Q4131648
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2252522&oldid=35399640"
    Powered by MediaWiki