@article{MATIYASEVICH2020257,
    Abstract = {The Riemann Hypothesis is reformulated as the statement that particular explicitly presented register machine with 29 registers and 130 instructions never halts.},
    Author = {Matiyasevich, Yu.},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {Riemann Hypothesis, Register machine},
    Note = {In memory of Maurice Nivat, a founding father of Theoretical Computer Science - Part II},
    Pages = {257-265},
    Title = {The Riemann Hypothesis in computer science},
    URL = {https://www.sciencedirect.com/science/article/pii/S0304397519304633},
    Volume = {807},
    Year = {2020},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397519304633},
    bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2019.07.028},
    date-added = {2021-03-15 14:03:42 +0100},
    date-modified = {2021-03-15 14:03:42 +0100},
    doi = {10.1016/j.tcs.2019.07.028}
}

@article{MATIYASEVICH2020257, Abstract = {The Riemann Hypothesis is reformulated as the statement that particular explicitly presented register machine with 29 registers and 130 instructions never halts.}, Author = {Matiyasevich, Yu.}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {Riemann Hypothesis, Register machine}, Note = {In memory of Maurice Nivat, a founding father of Theoretical Computer Science - Part II}, Pages = {257-265}, Title = {The Riemann Hypothesis in computer science}, URL = {https://www.sciencedirect.com/science/article/pii/S0304397519304633}, Volume = {807}, Year = {2020}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397519304633}, bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2019.07.028}, date-added = {2021-03-15 14:03:42 +0100}, date-modified = {2021-03-15 14:03:42 +0100}, doi = {10.1016/j.tcs.2019.07.028} }