Computing With Ions

[ Your Name ]  would like to inform you about this article on
Complexity Digest 2001.23 - 03.01
http://comdig.unam.mx/index.php?id_issue=2001.23#2283
04-Jun-2001

[ Your Message ]



Computing With Ions, Science
 









Excerpt: What Chaitin discovered was that no program
of complexity N can ever produce a number having complexity
greater than N. Therefore, the program of complexity N can never
halt by outputting the number specified by Chaitin's phrase. This
fact constitutes an algorithmic complexity version of the
unsolvability of the halting problem, a computer science version
of G&ouml;del's incompleteness theorem.

(&#133;) one can only wonder when the equally informal idea
of 'complex' will be formalized into a rich mathematical theory of
complex systems.



Formally
Speaking, John L.
Casti, Nature 411, 527 (2001)



You can discuss this article on Articles Forum
http://comdig.unam.mx/topic.php?id_article=2283

Your name:
Email from:
Email to:
Your message: