0 | |
<html><head>
|
1 | |
<meta http-equiv="Content-Type" content="text/html;CHARSET=iso-8859-1">
|
2 | |
<meta name="Description" content="Cat's Eye Technologies: The Ypsilax Language">
|
3 | |
<title>Cat's Eye Technologies: The Ypsilax Language</title>
|
4 | |
<meta name="Keywords" content=" Cat's Eye Technologies Language
|
5 | |
Programming computational computation non-deterministic
|
6 | |
constraint-based rewriting grid grid-rewriting gridrewriting
|
7 | |
minimal minimalist minimalistic tarpit tar pit pure language
|
8 | |
nondeterminstic experimental ">
|
|
0 |
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
|
|
1 |
<html xmlns="http://www.w3.org/1999/xhtml" lang="en">
|
|
2 |
<head>
|
|
3 |
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
|
|
4 |
<title>The Ypsilax Grid-Rewriting Language</title>
|
9 | 5 |
</head>
|
10 | 6 |
<body>
|
11 | 7 |
|
12 | 8 |
<h1>Ypsilax</h1>
|
13 | 9 |
|
14 | |
<p>Language version 0.9. Distribution version 2007.1202.<br>
|
15 | |
Copyright ©2001-2007, Cat's Eye Technologies. All rights reserved.</p>
|
|
10 |
<p>Language version 1.0, distribution revision 2010.0429.<br/>
|
|
11 |
Copyright ©2001-2010, Cat's Eye Technologies. All rights reserved.</p>
|
16 | 12 |
|
17 | |
<hr>
|
18 | |
<p>
|
19 | |
<ul><i>"In other words then, if a machine is expected to be infallible, it
|
|
13 |
<hr/>
|
|
14 |
|
|
15 |
<blockquote><p><i>"In other words then, if a machine is expected to be infallible, it
|
20 | 16 |
cannot also be intelligent. There are several mathematical theorems which say almost
|
21 | 17 |
exactly that. But these theorems say nothing about how much intelligence may be
|
22 | |
displayed if a machine makes no pretense at infallibility."</i>
|
23 | |
<ul>--- Grush and Churchland, <i>Gaps in Penrose's Toilings</i></ul></ul>
|
24 | |
<ul><i>"You know, I'm starting to think the humour of that misquote at the top
|
25 | |
of the Ypsilax documentation is a bit</i> too <i>subtle."</i>
|
26 | |
<ul>--- Chris Pressey, <i>Ypsilax</i> documentation</ul></ul>
|
|
18 |
displayed if a machine makes no pretense at infallibility."</i></p>
|
|
19 |
<p style="text-align: right">— Grush and Churchland, <i>Gaps in Penrose's Toilings</i></p></blockquote>
|
|
20 |
<blockquote><p><i>"You know, I'm starting to think the humour of that misquote at the top
|
|
21 |
of the Ypsilax documentation is a bit</i> too <i>subtle."</i></p>
|
|
22 |
<p style="text-align: right">— Chris Pressey, <i>Ypsilax</i> documentation</p></blockquote>
|
27 | 23 |
|
28 | 24 |
<h3>Ypsilax</h3>
|
29 | 25 |
|
|
54 | 50 |
two cells wide by one cell high, says that it is OK to replace any A found
|
55 | 51 |
below this rule with a B.</p>
|
56 | 52 |
|
57 | |
<p>Ypsilax is totally non-determinstic, like <a href="/projects/thue-+">Thue</a>.
|
58 | |
Each reduction consists of picking a rule by an unspecified method -
|
59 | |
for all you know, it is selected completely at random - and attempting to apply
|
|
53 |
<p>Ypsilax is totally non-determinstic, like <a href="/projects/thue/">Thue</a>.
|
|
54 |
Each reduction consists of picking a rule by an unspecified method —
|
|
55 |
for all you know, it is selected completely at random — and attempting to apply
|
60 | 56 |
it to some part of the playfield below the rule, again chosen by means unknown.
|
61 | 57 |
When this suceeds, that part of the playfield is rewritten.</p>
|
62 | 58 |
|