The Riemann Hypothesis in Computer Science
Login
University Home
→
Library
JavaScript is disabled for your browser. Some features of this site may not work without it.
The Riemann Hypothesis in Computer Science
Matiyasevich, Y
Identifier:
http://hdl.handle.net/2292/45072
Issue Date:
2018
Reference:
CDMTCS Research Reports CDMTCS-527 (2018)
Rights:
Copyright: The author
Rights (URI):
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
Abstract:
The Riemann Hypothesis is reformulated as the statement that particular explicitely presented register machine with 24 registers and 128 instructions never halts.
Show full item record
Files in this item
Name:
527.pdf
Size:
341.7Kb
Format:
PDF
Related URL:
https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php
This item appears in the following Collection(s)
CDMTCS Research Reports (1995+)
[574]
Share
Search ResearchSpace
Search ResearchSpace
This Collection
Browse
All of ResearchSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Statistics
View Usage Statistics