A Program-Size Complexity Measure for Mathematical Problems and Conjectures
Cristian Calude et al. in  have recently introduced the idea of measuring the degree of difficulty of a mathematical problem (even those still given as conjectures) by the length of a program to verify or refute the statement. The method to evaluate and compare problems, in some objective way, will be discussed in this note. For the practitioner, wishing to apply this method using a standard universal register machine language, we provide (for the first time) some “small” core subroutines or library for dealing with array data structures. These can be used to ease the development of full programs to check mathematical problems that require more than a predetermined finite number of variables.
Unable to display preview. Download preview PDF.
- 10.Calude, E.: The complexity of Riemann’s Hypothesis. Journal for Multiple-Valued Logic and Soft Computing (December 2010) (accepted)Google Scholar
- 11.Calude, E.: Fermat’s Last Theorem and chaoticity. Natural Computing (accepted, June 2011)Google Scholar
- 12.Calude, E.: The complexity of Goldbach’s Conjecture and Riemann’s Hypothesis, Report CDMTCS-370, Centre for Discrete Mathematics and Computer Science, p. 9 (2009)Google Scholar
- 14.Dinneen, M.J., Gimel’farb, G., Wilson, M.C.: Introduction to Algorithms, Data Structures and Formal Languages, 2nd edn., p. 264. Pearson Education, New Zealand (2009)Google Scholar
- 15.Knuth, D.E.: The Art of Computer Programming, 1st edn. Combinatorial Algorithms, Part 1, vol. 4A, p. xv+883. Addison-Wesley, Reading (2011) ISBN 0-201-03804-8 Google Scholar
- 16.Hertel, J.: On the Difficulty of Goldbach and Dyson Conjectures, Report CDMTCS-367, Centre for Discrete Mathematics and Theoretical Computer Science, p. 15 (2009)Google Scholar
- 18.Weisstein, E.W.: Chaitin’s Constant. From MathWorld–A Wolfram Web Resource (2011), http://mathworld.wolfram.com/ChaitinsConstant.html