View(s) :
2 (0 ULiège)
Download(s) :
6 (0 ULiège)
p. 3-20
This paper discusses the presence of undecidable problems in mathematics, with reference to the halting problem for algorithms, the hypergame paradox and the paradox of the well-founded sets. All these results are curiously related to self-reference and the strange loop by which a self-observing system can indicate its own operations to itself.
Louis H. Kauffman, « On The Halting Problem », CASYS, 28 | 2014, 3-20.
Louis H. Kauffman, « On The Halting Problem », CASYS [Online], 28 | 2014, Online since 10 October 2024, connection on 27 December 2024. URL : http://popups.uliege.be/3041-539x/index.php?id=4351
University of Illinois at Chicago, Mathematics Department, 851 South Morgan Street, Chicago, IL 60607-7045