dc.contributor.author |
Calude, C.S |
en |
dc.contributor.author |
Calude, E |
en |
dc.contributor.author |
Dinneen, Michael |
en |
dc.date.accessioned |
2009-04-16T23:15:03Z |
en |
dc.date.available |
2009-04-16T23:15:03Z |
en |
dc.date.issued |
2006-02 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-277 (2006) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3784 |
en |
dc.description.abstract |
Guessing the degree of difficulty of a problem before seeing its solution is notoriously
hard not only for beginners, but also for the most experienced professionals.
Can we develop a method to evaluate, in some objective way, the difficulty of an
open problem? This note proposes such a measure which can be used for a fairly
large class of finitely refutable conjectures which includes, for example, Riemann
Hypothesis and the Goldbach’s Conjecture. According to our measure, Riemann
Hypothesis is more complex than Goldbach’s Conjecture. We also show, in a nonconstructive
way, that the Collatz 3x+1 Problem is finitely refutable; consequently,
our method cannot be applied, hence stronger versions of this problem are studied. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
A New Measure of the Difficulty of Problems |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |