0 | 0 |
# encoding: UTF-8
|
1 | |
|
2 | |
Braktif:
|
3 | |
type: Automaton
|
4 | |
genre: Esolang
|
5 | |
paradigms:
|
6 | |
- Cellular automaton
|
7 | |
description: |
|
8 | |
Braktif is a cellular automaton modelled closely after the [[brainfuck]]
|
9 | |
programming language.
|
10 | |
computational-class: believed Turing-complete
|
11 | |
esowiki: Braktif
|
12 | |
authors:
|
13 | |
- Chris Pressey
|
14 | |
auspices:
|
15 | |
- Cat's Eye Technologies
|
16 | |
etymology:
|
17 | |
- television character
|
18 | |
- portmanteau
|
19 | |
- french
|
20 | |
influences:
|
21 | |
- brainfuck
|
22 | |
paradigms:
|
23 | |
- Cellular automaton
|
24 | |
dimensionality: 2
|
25 | |
sample: |2
|
26 | |
*
|
27 | |
<<*[--]*
|
28 | |
000000000000000000 *[----- --]
|
29 | |
-----------------d-i-- --------
|
30 | |
inception-date: 2005
|
31 | |
development-stage: mature
|
32 | |
|
33 | |
braktif.alp:
|
34 | |
type: Implementation
|
35 | |
implementation-of:
|
36 | |
- Braktif
|
37 | |
reference: true
|
38 | |
prebuilt-for-platforms:
|
39 | |
- Perl
|
40 | |
- Javascript
|
41 | |
in-distribution: Braktif distribution
|
42 | |
license: BSD license
|
43 | |
implementation-type: formal description
|
44 | |
host-language: ALPACA
|
45 | |
file-locations:
|
46 | |
- https://github.com/catseye/Braktif/blob/master/src/braktif.alp
|
47 | |
online-locations:
|
48 | |
- installation/Braktif
|
49 | 1 |
|
50 | 2 |
|
51 | 3 |
Chzrxl:
|
|
84 | 36 |
- Chzrxl
|
85 | 37 |
online-locations:
|
86 | 38 |
- installation/Chzrxl
|
87 | |
|
88 | |
|
89 | |
Circute:
|
90 | |
type: Automaton
|
91 | |
genre: Esolang
|
92 | |
paradigms:
|
93 | |
- Cellular automaton
|
94 | |
description: |
|
95 | |
Circute is a cellular automaton that simulates conduits that
|
96 | |
carry digital signals and NAND gates that manipulate those signals.
|
97 | |
esowiki: Circute
|
98 | |
paradigms:
|
99 | |
- Cellular automaton
|
100 | |
etymology:
|
101 | |
- portmanteau
|
102 | |
influences:
|
103 | |
- Wireworld
|
104 | |
dimensionality: 2
|
105 | |
computational-class: known not Turing-complete
|
106 | |
authors:
|
107 | |
- Chris Pressey
|
108 | |
auspices:
|
109 | |
- Cat's Eye Technologies
|
110 | |
sample: |2
|
111 | |
=
|
112 | |
=
|
113 | |
#######== ===N=== =========
|
114 | |
# = = = = =
|
115 | |
==N== = ==N== ==N== = ==N==
|
116 | |
= = = = = = = = = =
|
117 | |
===== = ===== ===== = =====
|
118 | |
= = = = = =
|
119 | |
============= =============
|
120 | |
inception-date: 2005
|
121 | |
development-stage: mature
|
122 | |
|
123 | |
tc.catseye.yoob.circute:
|
124 | |
type: Implementation
|
125 | |
implementation-of:
|
126 | |
- Circute
|
127 | |
in-distribution: yoob distribution
|
128 | |
prebuilt-for-platforms:
|
129 | |
- yoob
|
130 | |
license: Public Domain
|
131 | |
implementation-type: interpreter
|
132 | |
host-language: Java
|
133 | |
host-platform: yoob
|
134 | |
online-locations:
|
135 | |
- installation/yoob
|
136 | |
|
137 | |
circute.alp:
|
138 | |
type: Implementation
|
139 | |
implementation-of:
|
140 | |
- Circute
|
141 | |
reference: true
|
142 | |
in-distribution: Circute distribution
|
143 | |
prebuilt-for-platforms:
|
144 | |
- Perl
|
145 | |
- Javascript
|
146 | |
license: BSD license
|
147 | |
implementation-type: formal description
|
148 | |
host-language: ALPACA
|
149 | |
file-locations:
|
150 | |
- https://github.com/catseye/Circute/blob/master/src/circute.alp
|
151 | |
online-locations:
|
152 | |
- installation/Circute
|
153 | 39 |
|
154 | 40 |
|
155 | 41 |
Cyclobots:
|
|
198 | 84 |
development-stage: mature
|
199 | 85 |
online-locations:
|
200 | 86 |
- installation/Cyclobots
|
201 | |
|
202 | |
|
203 | |
Didigm:
|
204 | |
# technically a family, but Didigm also refers to the member Didigm(8),
|
205 | |
# and the family is not that interesting.
|
206 | |
type: Automaton
|
207 | |
summary: A reflective cellular automaton
|
208 | |
genre: Esolang
|
209 | |
paradigms:
|
210 | |
- Cellular automaton
|
211 | |
- Reflective
|
212 | |
description: |
|
213 | |
Didigm is a reflective cellular automaton: the transition rules
|
214 | |
for the automaton are defined by forms in the very playfield governed by
|
215 | |
those transition rules.
|
216 | |
tagline: |-
|
217 | |
Didigm = ALPACA + Ypsilax
|
218 | |
authors:
|
219 | |
- Chris Pressey
|
220 | |
auspices:
|
221 | |
- Cat's Eye Technologies
|
222 | |
esowiki: Didigm
|
223 | |
defining-distribution: Specs on Spec distribution
|
224 | |
dimensionality: 2
|
225 | |
inception-date: Nov 20, 2007
|
226 | |
development-stage: not fully complete
|
227 | |
etymology:
|
228 | |
- neologism
|
229 | |
sample: |
|
230 | |
3333333333333
|
231 | |
3002300230073
|
232 | |
3111311132113
|
233 | |
3311321131573
|
234 | |
3111311131333
|
235 | |
3333333333333
|
236 | |
=F3
|
237 | |
,
|
238 | |
=F1
|
239 | |
111111111111111
|
240 | |
111111131111111
|
241 | |
111111111111574
|
242 | |
111111111111333
|
243 | |
311111111111023
|
244 | |
111111111111113
|
245 | |
|
246 | |
|
247 | |
Jaccia:
|
248 | |
type: Automaton
|
249 | |
genre: Esolang
|
250 | |
paradigms:
|
251 | |
- Cellular automaton
|
252 | |
- 2-dimensional
|
253 | |
description: |
|
254 | |
Jaccia and Jacciata are cellular automata inspired by the [Announcement
|
255 | |
of Scientific Proof that Slime Molds are Intelligent Maze Solvers](http://web.archive.org/web/20020220163303/http://www.riken.go.jp/lab-www/frontier-div/NEWSLETTER/feb2001/ameboid_e.htm).
|
256 | |
Jaccia can solve mazes too, by a similar mechanism (shrinking). Jacciata builds
|
257 | |
upon this to find the shortest path through a maze, if one exists and is unique.
|
258 | |
authors:
|
259 | |
- Chris Pressey
|
260 | |
auspices:
|
261 | |
- Cat's Eye Technologies
|
262 | |
inception-date: Apr 11, 2009
|
263 | |
development-stage: mature
|
264 | |
dimensionality: 2
|
265 | |
etymology:
|
266 | |
- neologism
|
267 | |
computational-class: known not Turing-complete
|
268 | |
sample: |
|
269 | |
#######S###
|
270 | |
#:::::::::#
|
271 | |
#:###:###:#
|
272 | |
#:#:#:::#:#
|
273 | |
#:#:#:#:###
|
274 | |
#:::#:#:#:#
|
275 | |
#####:#:#:#
|
276 | |
#:#:::#:::#
|
277 | |
#:#:###:###
|
278 | |
#:::#:::::#
|
279 | |
#########F#
|
280 | |
sample-output: |
|
281 | |
#######S###
|
282 | |
# ::: #
|
283 | |
# ###:### #
|
284 | |
# # #:::# #
|
285 | |
# # # #:###
|
286 | |
# # #:# #
|
287 | |
##### #:# #
|
288 | |
# # #: #
|
289 | |
# # ###:###
|
290 | |
# # :::#
|
291 | |
#########F#
|
292 | |
|
293 | |
Jacciata:
|
294 | |
type: Automaton
|
295 | |
genre: Esolang
|
296 | |
variant-of: Jaccia
|
297 | |
paradigms:
|
298 | |
- Cellular automaton
|
299 | |
- 2-dimensional
|
300 | |
description: |
|
301 | |
Jaccia and Jacciata are cellular automata inspired by the [Announcement
|
302 | |
of Scientific Proof that Slime Molds are Intelligent Maze Solvers](http://web.archive.org/web/20020220163303/http://www.riken.go.jp/lab-www/frontier-div/NEWSLETTER/feb2001/ameboid_e.htm).
|
303 | |
Jaccia can solve mazes too, by a similar mechanism (shrinking). Jacciata builds
|
304 | |
upon this to find the shortest path through a maze, if one exists and is unique.
|
305 | |
authors:
|
306 | |
- Chris Pressey
|
307 | |
auspices:
|
308 | |
- Cat's Eye Technologies
|
309 | |
inception-date: Apr 11, 2009
|
310 | |
development-stage: mature
|
311 | |
dimensionality: 2
|
312 | |
etymology:
|
313 | |
- neologism
|
314 | |
computational-class: known not Turing-complete
|
315 | |
sample: |
|
316 | |
#######S###
|
317 | |
#:::::::::#
|
318 | |
#:###:###:#
|
319 | |
#:#:#:::#:#
|
320 | |
#:#:#:#:###
|
321 | |
#:::#:#:#:#
|
322 | |
#####:#:#:#
|
323 | |
#:#:::#:::#
|
324 | |
#:#:###:###
|
325 | |
#:::#:::::#
|
326 | |
#########F#
|
327 | |
sample-output: |
|
328 | |
#######S###
|
329 | |
# ::: #
|
330 | |
# ###:### #
|
331 | |
# # #:::# #
|
332 | |
# # # #:###
|
333 | |
# # #:# #
|
334 | |
##### #:# #
|
335 | |
# # #: #
|
336 | |
# # ###:###
|
337 | |
# # :::#
|
338 | |
#########F#
|
339 | |
|
340 | |
jaccia.alp:
|
341 | |
type: Implementation
|
342 | |
implementation-of:
|
343 | |
- Jaccia
|
344 | |
reference: true
|
345 | |
in-distribution: Jaccia and Jacciata distribution
|
346 | |
prebuilt-for-platforms:
|
347 | |
- Perl
|
348 | |
- Javascript
|
349 | |
license: BSD license
|
350 | |
implementation-type: formal description
|
351 | |
host-language: ALPACA
|
352 | |
file-locations:
|
353 | |
- https://github.com/catseye/Jaccia/blob/master/src/jaccia.alp
|
354 | |
online-locations:
|
355 | |
- installation/Jaccia
|
356 | |
|
357 | |
jacciata.alp:
|
358 | |
type: Implementation
|
359 | |
implementation-of:
|
360 | |
- Jacciata
|
361 | |
reference: true
|
362 | |
in-distribution: Jaccia and Jacciata distribution
|
363 | |
prebuilt-for-platforms:
|
364 | |
- Perl
|
365 | |
- Javascript
|
366 | |
license: BSD license
|
367 | |
implementation-type: formal description
|
368 | |
host-language: ALPACA
|
369 | |
file-locations:
|
370 | |
- https://github.com/catseye/Jaccia/blob/master/src/jacciata.alp
|
371 | |
online-locations:
|
372 | |
- installation/Jacciata
|
373 | |
|
374 | |
|
375 | |
"noit o' mnain worb":
|
376 | |
type: Automaton
|
377 | |
genre: Esolang
|
378 | |
paradigms:
|
379 | |
- Particle automaton
|
380 | |
- Probabilistic
|
381 | |
quotation: |-
|
382 | |
Under pressure
|
383 | |
quotation-attribution: |-
|
384 | |
Queen
|
385 | |
description: |
|
386 | |
noit o' mnain worb is a probabilistic particle automaton that
|
387 | |
uses pressure between randomly moving particles to approximate the behaviour
|
388 | |
of circuits. It can approximate computation with these circuits, too, but
|
389 | |
it's so lossy that it has more value as just a neat toy to watch.
|
390 | |
|
391 | |
(The name of this language contains a *secret message*! Can *you* find it?)
|
392 | |
authors:
|
393 | |
- Chris Pressey
|
394 | |
auspices:
|
395 | |
- Cat's Eye Technologies
|
396 | |
inception-date: Sep 15, 2000
|
397 | |
development-stage: mature
|
398 | |
etymology:
|
399 | |
- neologism
|
400 | |
- hidden message
|
401 | |
- celtic
|
402 | |
notable: true
|
403 | |
esowiki: noit_o'_mnain_worb
|
404 | |
dimensionality: 2
|
405 | |
sample: |
|
406 | |
##### #####
|
407 | |
# ########### #
|
408 | |
# . > < . #
|
409 | |
# #####v##### #
|
410 | |
##### # ########
|
411 | |
# >!#
|
412 | |
#v#########
|
413 | |
# #
|
414 | |
###
|
415 | |
|
416 | |
worb.pl:
|
417 | |
type: Implementation
|
418 | |
implementation-of:
|
419 | |
- noit o' mnain worb
|
420 | |
in-distribution: noit o' mnain worb distribution
|
421 | |
license: BSD license
|
422 | |
reference: yes
|
423 | |
implementation-type: interpreter
|
424 | |
host-language: Perl
|
425 | |
|
426 | |
worb.js:
|
427 | |
type: Implementation
|
428 | |
implementation-of:
|
429 | |
- noit o' mnain worb
|
430 | |
in-distribution: noit o' mnain worb distribution
|
431 | |
license: BSD license
|
432 | |
implementation-type: interpreter
|
433 | |
host-language: Javascript
|
434 | |
host-platform: HTML5
|
435 | |
online-locations:
|
436 | |
- installation/noit o' mnain worb
|
437 | |
|
438 | |
tc.catseye.yoob.worb:
|
439 | |
type: Implementation
|
440 | |
implementation-of:
|
441 | |
- noit o' mnain worb
|
442 | |
in-distribution: noit o' mnain worb distribution
|
443 | |
license: BSD license
|
444 | |
implementation-type: interpreter
|
445 | |
host-language: Java
|
446 | |
host-platform: yoob
|
447 | |
online-locations:
|
448 | |
- installation/yoob
|
449 | |
|
450 | |
|
451 | |
REDGREEN:
|
452 | |
type: Automaton
|
453 | |
genre: Esolang
|
454 | |
paradigms:
|
455 | |
- Cellular automaton
|
456 | |
description: |
|
457 | |
REDGREEN is a cellular automaton that simulates a little
|
458 | |
"physical world", much like [[RUBE]].
|
459 | |
authors:
|
460 | |
- Chris Pressey
|
461 | |
auspices:
|
462 | |
- Cat's Eye Technologies
|
463 | |
computational-class: Turing-complete
|
464 | |
etymology:
|
465 | |
- television program
|
466 | |
influences:
|
467 | |
- RUBE
|
468 | |
dimensionality: 2
|
469 | |
esowiki: REDGREEN
|
470 | |
sample: |2
|
471 | |
# #
|
472 | |
...... # #
|
473 | |
# ~ #
|
474 | |
####################### #
|
475 | |
%# #
|
476 | |
. . . T ##### #
|
477 | |
### # : #
|
478 | |
# #
|
479 | |
# . #
|
480 | |
# #
|
481 | |
# #
|
482 | |
# . #
|
483 | |
# #
|
484 | |
# #
|
485 | |
>>>>>>>>>>>>>>>##<<<<<<<<<<<<<<<<<############################
|
486 | |
%
|
487 | |
T
|
488 | |
inception-date: 1998
|
489 | |
development-stage: mature
|
490 | |
|
491 | |
redgreen.alp:
|
492 | |
type: Implementation
|
493 | |
implementation-of:
|
494 | |
- REDGREEN
|
495 | |
reference: true
|
496 | |
in-distribution: REDGREEN distribution
|
497 | |
prebuilt-for-platforms:
|
498 | |
- Perl
|
499 | |
- Javascript
|
500 | |
license: BSD license
|
501 | |
implementation-type: formal description
|
502 | |
host-language: ALPACA
|
503 | |
file-locations:
|
504 | |
- https://github.com/catseye/REDGREEN/blob/master/src/redgreen.alp
|
505 | |
online-locations:
|
506 | |
- installation/REDGREEN
|
507 | |
|
508 | |
|
509 | |
RUBE:
|
510 | |
type: Automaton
|
511 | |
genre: Esolang
|
512 | |
paradigms:
|
513 | |
- Bully automaton
|
514 | |
- 2-dimensional
|
515 | |
description: |
|
516 | |
RUBE is an esoteric programming language in tribute to [[Rube Goldberg]],
|
517 | |
with bulldozers pushing around numbered crates, knocking them together to
|
518 | |
perform computations. It is based on a variant of a cellular automaton called
|
519 | |
a *[[Bully automaton|bully automaton]]*, where certain state changes can
|
520 | |
force other state changes to occur elsewhere in the playfield.
|
521 | |
authors:
|
522 | |
- Chris Pressey
|
523 | |
auspices:
|
524 | |
- Cat's Eye Technologies
|
525 | |
basis-for-game: true
|
526 | |
inception-date: 1997
|
527 | |
development-stage: mature
|
528 | |
etymology:
|
529 | |
- masculine given name
|
530 | |
- acronym
|
531 | |
esowiki: RUBE
|
532 | |
dimensionality: 2
|
533 | |
notable: true
|
534 | |
sample: |2
|
535 | |
0a21646c726f77202c6f6c6c6548
|
536 | |
, :::::::::::::::::::::::::::: ,
|
537 | |
)
|
538 | |
==============================
|
539 | |
F
|
540 | |
O F
|
541 | |
c
|
542 | |
=
|
543 | |
|
544 | |
rube.c:
|
545 | |
type: Implementation
|
546 | |
implementation-of:
|
547 | |
- RUBE
|
548 | |
in-distribution: RUBE distribution
|
549 | |
reference: true
|
550 | |
license: BSD license
|
551 | |
implementation-type: interpreter
|
552 | |
# can also be built with C99
|
553 | |
host-language: ANSI C
|
554 | |
can-be-built-with-borland-c: true
|
555 | |
run-requirements:
|
556 | |
- ANSI Terminal
|
557 | |
|
558 | |
|
559 | |
Schrödinger's Game of Life:
|
560 | |
type: Automaton
|
561 | |
genre: Experimental language
|
562 | |
paradigms:
|
563 | |
- 2-dimensional
|
564 | |
- Cellular automaton
|
565 | |
- Non-deterministic
|
566 | |
development-stage: mature
|
567 | |
defining-distribution: Schrödinger's Game of Life distribution
|
568 | |
authors:
|
569 | |
- Chris Pressey
|
570 | |
auspices:
|
571 | |
- Cat's Eye Technologies
|
572 | |
see-also:
|
573 | |
- Conway's Game of Life
|
574 | |
- Schrödinger's Cat
|
575 | |
inception-date: Feb 7 2015
|
576 | |
description: |
|
577 | |
Schrödinger's Game of Life is what happens when [[Conway's Game of Life]]
|
578 | |
meets [[Schrödinger's Cat]]: each individual cell may be **Alive**,
|
579 | |
or **Dead**, or **Possibly-Alive-Possibly-Dead** (which we call **Cat**.)
|
580 | |
|
581 | |
This is, in essence, the result of applying
|
582 | |
[[Non-deterministic|non-determinism]] to an existing
|
583 | |
[[Cellular automaton|cellular automaton]], and this operation could
|
584 | |
probably be applied to any cellular automaton with similar results.
|
585 | |
|
586 | |
For a full account of its development, see
|
587 | |
[its README document](https://github.com/catseye/Schroedingers-Game-of-Life/blob/master/README.md).
|
588 | |
|
589 | |
slife.js:
|
590 | |
type: Implementation
|
591 | |
license: Public Domain
|
592 | |
host-language: Javascript
|
593 | |
host-platform: HTML5
|
594 | |
implementation-of:
|
595 | |
- Schrödinger's Game of Life
|
596 | |
in-distribution: Schrödinger's Game of Life distribution
|
597 | |
online-locations:
|
598 | |
- installation/Schrödinger's Game of Life
|
599 | |
|
600 | |
slife:
|
601 | |
type: Implementation
|
602 | |
license: Public Domain
|
603 | |
host-language: Python
|
604 | |
implementation-of:
|
605 | |
- Schrödinger's Game of Life
|
606 | |
in-distribution: Schrödinger's Game of Life distribution
|
607 | |
reference: true
|
608 | |
|
609 | |
|
610 | |
SMETANA:
|
611 | |
type: Automaton
|
612 | |
genre: Esolang
|
613 | |
paradigms:
|
614 | |
- Self-modifying
|
615 | |
esowiki: SMETANA
|
616 | |
acronym-for: Self-Modifying Extremely Tiny AutomatoN Application
|
617 | |
summary: A pathological little self-modifying language
|
618 | |
description: |
|
619 | |
SMETANA is a pathological little self-modifying language with only two
|
620 | |
possible operations: Go to step *n*, and Swap steps *n* and *m*.
|
621 | |
It has inspired a few variants and developments, notably a proof that
|
622 | |
despite its minimalism, it is finite-automata-complete; it is also the
|
623 | |
(great-?)grandfather of [[SMITH]].
|
624 | |
etymology:
|
625 | |
- dairy product
|
626 | |
- russian
|
627 | |
- surname
|
628 | |
sample: |-
|
629 | |
Step 1. Swap step 1 with step 2.
|
630 | |
Step 2. Go to step 2.
|
631 | |
Step 3. Go to step 1.
|
632 | |
authors:
|
633 | |
- Chris Pressey
|
634 | |
# technically, Cat's Eye Technologies did not exist at the time, but
|
635 | |
# let's face it, it's been maintained by them ever since they started
|
636 | |
auspices:
|
637 | |
- Cat's Eye Technologies
|
638 | |
inception-date: ca 1994
|
639 | |
development-stage: archival
|
640 | |
computational-class: known not Turing-complete
|
641 | |
notable: true
|
642 | |
see-also:
|
643 | |
- Cyclobots
|
644 | |
|
645 | |
smetana.pl:
|
646 | |
type: Implementation
|
647 | |
implementation-of:
|
648 | |
- SMETANA
|
649 | |
in-distribution: SMETANA distribution
|
650 | |
license: Public Domain
|
651 | |
reference: yes
|
652 | |
implementation-type: interpreter
|
653 | |
host-language: Perl
|
654 | |
|
655 | |
tc.catseye.yoob.smetana:
|
656 | |
type: Implementation
|
657 | |
implementation-of:
|
658 | |
- SMETANA
|
659 | |
in-distribution: yoob distribution
|
660 | |
prebuilt-for-platforms:
|
661 | |
- yoob
|
662 | |
license: Public Domain
|
663 | |
implementation-type: interpreter
|
664 | |
host-language: Java
|
665 | |
host-platform: yoob
|
666 | |
online-locations:
|
667 | |
- installation/yoob
|
668 | |
|
669 | |
SMETANA (Visual Basic):
|
670 | |
type: Implementation
|
671 | |
implementation-of:
|
672 | |
- SMETANA
|
673 | |
license: Freely Redistributable
|
674 | |
implementation-type: interpreter
|
675 | |
host-language: Visual Basic
|
676 | |
development-stage: lost
|
677 | |
interface: GUI
|
678 | |
|
679 | |
|
680 | |
Xigxag:
|
681 | |
# technically a family, but the family is not that interesting.
|
682 | |
type: Automaton
|
683 | |
genre: Esolang
|
684 | |
paradigms:
|
685 | |
- String-rewriting
|
686 | |
description: |
|
687 | |
Xigxag is a simple string-copying automaton that has exponential
|
688 | |
growth almost everywhere (i.e. there are only a finite number of initial
|
689 | |
configurations that don't blow up.)
|
690 | |
authors:
|
691 | |
- Chris Pressey
|
692 | |
auspices:
|
693 | |
- Cat's Eye Technologies
|
694 | |
# started 2001
|
695 | |
esowiki: Xigxag
|
696 | |
inception-date: Apr 23, 2007
|
697 | |
development-stage: mature
|
698 | |
sample: |
|
699 | |
><<
|
700 | |
sample-output: |
|
701 | |
><<
|
702 | |
<<>><
|
703 | |
<><<<<>>
|
704 | |
<<<<>><><><<><<<><<<>
|
705 | |
...
|
706 | |
computational-class: unknown computational class
|
707 | |
unusual-computability-properties: true
|
708 | |
|
709 | |
xigxag.pl:
|
710 | |
type: Implementation
|
711 | |
implementation-of:
|
712 | |
- Xigxag
|
713 | |
in-distribution: Xigxag distribution
|
714 | |
reference: true
|
715 | |
license: Public Domain
|
716 | |
implementation-type: interpreter
|
717 | |
host-language: Perl
|
718 | |
|
719 | |
|
720 | |
Zame:
|
721 | |
# technically a family.
|
722 | |
type: Programming Language
|
723 | |
genre: Esolang
|
724 | |
paradigms:
|
725 | |
# kind of...
|
726 | |
- Maze-space-rewriting
|
727 | |
variant-of: Etcha
|
728 | |
description: |
|
729 | |
Zame is an automaton which uses the solution of a maze to
|
730 | |
generate an [[Etcha]] program which draws a new maze, then
|
731 | |
the process repeats. An open question is to find a maze for which
|
732 | |
this process repeats indefinitely.
|
733 | |
|
734 | |
Information on this language is only available on the Esowiki for now.
|
735 | |
authors:
|
736 | |
- Chris Pressey
|
737 | |
auspices:
|
738 | |
- Cat's Eye Technologies
|
739 | |
esowiki: Zame
|
740 | |
inception-date: Jan 2009
|
741 | |
development-stage: not fully complete
|
742 | |
sample: |
|
743 | |
#########
|
744 | |
# # #
|
745 | |
# # # ###
|
746 | |
# # #
|
747 | |
### # # #
|
748 | |
# # # #
|
749 | |
#########
|
750 | |
computational-class: unknown computational class
|
751 | |
unusual-computability-properties: true
|
752 | |
specification-link: esowiki
|