Abstract

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.

Text

Download Facsimile [PDF, 7.6M]

References

Bibliographical reference

Louis H. Kauffman, « On The Halting Problem », CASYS, 28 | 2014, 3-20.

Electronic reference

Louis H. Kauffman, « On The Halting Problem », CASYS [Online], 28 | 2014, Online since 10 October 2024, connection on 14 November 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=4351

Author

Louis H. Kauffman

University of Illinois at Chicago, Mathematics Department, 851 South Morgan Street, Chicago, IL 60607-7045

By this author

Copyright

CC BY-SA 4.0 Deed