Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
The Art of Computer Programming: Combinatorial Algorithms, Part 1
The Art of Computer Programming: Combinatorial Algorithms, Part 1
Fermat's last theorem and chaoticity
Natural Computing: an international journal
The complexity of Euler's integer partition theorem
Theoretical Computer Science
Inductive complexity of p versus NP problem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Inductive complexity of goodstein's theorem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
| Hi-index | 0.00 |
Cristian Calude et al. in [5] 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.