The Riemann Hypothesis in Computer Science

Matiyasevich, Y

dc.contributor.author	Matiyasevich, Y	en
dc.date.accessioned	2019-01-09T02:23:06Z	en
dc.date.available	2019-01-09T02:23:06Z	en
dc.date.issued	2018	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-527 (2018)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/45072	en
dc.description.abstract	The Riemann Hypothesis is reformulated as the statement that particular explicitely presented register machine with 24 registers and 128 instructions never halts.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php	en
dc.title	The Riemann Hypothesis in Computer Science	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research	en
dc.rights.holder	Copyright: The author	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en