1. Cat's Eye Technologies
  2. Xigxag


catseye  committed a35f399

Update links.

  • Participants
  • Parent commits 1daa0e3
  • Branches default

Comments (0)

Files changed (1)

File doc/xigxag.html

View file
  • Ignore whitespace
 <p>So, how would one go about confirming my intuition and proving that
 Xigxag isn't Turing-complete?</p>
-<p>For some languages, like <a href="/projects/b_juliet/">beta-Juliet</a>
-or <a href="/projects/smetana/">SMETANA</a>,
+<p>For some languages, like <a href="http://catseye.tc/projects/beta-juliet/">beta-Juliet</a>
+or <a href="http://catseye.tc/projects/smetana/">SMETANA</a>,
 we can say that, because every program gives rise to only a finite
 number of possible internal configurations during a run (no matter its input), and because Turing machines can take
 on an infinite number of internal configurations during a run, the language can't possibly