9464

Hofstadter's MU Riddle

Originally proposed by Douglas Hofstadter in his seminal work Gödel, Escher, Bach: An Eternal Golden Braid, the MU-Puzzle describes a formal system with a single axiom and four rules used to generate new theorems, written as sequences over the alphabet {M,I,U}, from the axiom MI by repeated application of the following rules:
1. If a string ends in I, you may append a U onto the end.
2. If a string is of the form Mx, you may rewrite it to Mxx.
3. If the string contains III, you may replace those letters with U.
4. If the string contains UU, you may remove those letters.
The puzzle is to answer the following question: is MU a theorem of the system?

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.









 
RELATED RESOURCES
Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Powered by Wolfram Mathematica © 2014 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+