Volume 11, Issue 2
|
Articles
Mathematica Resources
Download This Issue
Editorial Policy
Staff and Contributors
Submissions
Back Issues
Contact Information
Computing the Uncomputable Rado Sigma Function
An Automated, Symbolic Induction Prover for Nonhalting Turing Machines We discuss a new tool that is successfully used in an
ongoing project to compute Σ(5): an automated symbolic induction prover (SIP). The SIP tool is written
in Mathematica and provides a unified way to prove that large sets of Turing machines are
nonhalters. In a way, an SIP enables certain Turing machines to provide their own proof of being a nonhalter.
| About the Author Joachim Hertel’s main area of research includes quantum computation and the theory of computability. Hertel’s special interest is in the general topic “Minds and Machines”, particularly the question of what role Rado’s Σ function and Chaitin’s Ω number play in this context. Joachim Hertel 50 Main St, STE 1000 White Plains, NY,10606 jhertel@h-star.com |
NotebookAbout Mathematica | Download Mathematica Player
© 2009 Wolfram Media, Inc. All rights reserved.