## Tree @master (Download .tar.gz)

## Burro.lhs @master — raw · history · blame

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 | ```
-> encoding: UTF-8
The Burro Programming Language
==============================
Version 2.0
June 2010, Chris Pressey, Cat's Eye Technologies
Introduction
------------
Burro is a programming language whose programs form an algebraic group under
the operation of concatenation and over the equivalence relation of "computes
the same function." This means that, for every Burro program, we can
construct a corresponding antiprogram that, when appended onto the first
program, results in a "no-op" program (a program with no effect — the
identity function.)
(In fact, for every set of Burro programs that compute the same function,
there is a corresponding set of antiprograms, any of which can "cancel out"
any program in the first set. From our proof that Burro programs form a
group, we obtain a constructive algorithm which, for any given program, will
derive only one corresponding antiprogram, a kind of syntactic inverse.)
This is a kind of reversible computing, but Burro differs from most reversible
languages in that it is not the execution trace that is being "undone", but
the program itself that is being annihilated.
This document describes version 2.0 of the Burro language, a reformulation
which addresses several issues with Burro 1.0. An update to the language was
desired by the author after it was pointed out by Alex Smith that the set of
Burro version 1.0 programs do not, in fact, form a proper group (the inverse
of (/) is {\}, but no inverse of {\} is defined; also, the implementations
(at least) did not support moving the tape head left past the "start" of the
tape, so <> was not a well-defined program.)
Additionally in this document, we construct a Burro 2.0 program equivalent to
a certain Turing machine. While this Turing machine is not universal, the
translation method we use demonstrates how it would be possible to map an
arbitrary Turing machine to a Burro program, hopefully making uncontroversial
the idea that Burro qualifies as universal.
For further background information on the Burro project, you may also wish
to read the [Burro 1.0 article](../doc/burro-1.0.html), with the understanding
that the language description given there is obsolete.
Changes from Burro 1.0
----------------------
The {\} construct does not appear in Burro 2.0. Instead, the (/) construct
serves as its own inverse. The tree-like structure of decision continuations
is not present in Burro 2.0 either. Instead, decision information is kept on
a second tape, called the "stack tape".
Henceforth in this document, the term Burro refers to Burro 2.0.
About this Document
-------------------
This document is a reference implementation of Burro in literate Haskell,
using Markdown syntax for the textual prose portions (although the version
you are reading may have been converted to another format, such as HTML,
for presentation.) As such, this document serves as an "executable
semantics", both defining the language and providing a ready tool.
> module Main where
> import System.Environment
Inductive Definition of a Burro Program
---------------------------------------
The symbol e is a Burro program.
The symbol ! is a Burro program.
The symbol + is a Burro program.
The symbol - is a Burro program.
The symbol < is a Burro program.
The symbol > is a Burro program.
If a and b are Burro programs, then (a/b) is a Burro program.
If a and b are Burro programs, then ab is a Burro program.
Nothing else is a Burro program.
> data Burro = Null
> | ToggleHalt
> | Inc
> | Dec
> | GoLeft
> | GoRight
> | Test Burro Burro
> | Seq Burro Burro
> deriving (Read, Eq)
Representation of Burro Programs
--------------------------------
For a concrete representation, the symbols in the inductive definition
given above can be taken to be a subset of a character set; for the
purposes of this semantics, we will use the ASCII character set. Parsing
a given string of symbols into a Burro program is straightforward; all
symbols which are not Burro symbols are simply ignored.
> instance Show Burro where
> show Null = "e"
> show ToggleHalt = "!"
> show Inc = "+"
> show Dec = "-"
> show GoLeft = "<"
> show GoRight = ">"
> show (Test a b) = "(" ++ (show a) ++ "/" ++ (show b) ++ ")"
> show (Seq a b) = (show a) ++ (show b)
>
> parse string =
> let
> (rest, acc) = parseProgram string Null
> in
> trim acc
>
> parseProgram [] acc =
> ([], acc)
> parseProgram ('e':rest) acc =
> parseProgram rest (Seq acc Null)
> parseProgram ('+':rest) acc =
> parseProgram rest (Seq acc Inc)
> parseProgram ('-':rest) acc =
> parseProgram rest (Seq acc Dec)
> parseProgram ('<':rest) acc =
> parseProgram rest (Seq acc GoLeft)
> parseProgram ('>':rest) acc =
> parseProgram rest (Seq acc GoRight)
> parseProgram ('!':rest) acc =
> parseProgram rest (Seq acc ToggleHalt)
> parseProgram ('(':rest) acc =
> let
> (rest', thenprog) = parseProgram rest Null
> (rest'', elseprog) = parseProgram rest' Null
> test = Test thenprog elseprog
> in
> parseProgram rest'' (Seq acc test)
> parseProgram ('/':rest) acc =
> (rest, acc)
> parseProgram (')':rest) acc =
> (rest, acc)
> parseProgram (_:rest) acc =
> parseProgram rest acc
>
> trim (Seq Null a) = trim a
> trim (Seq a Null) = trim a
> trim (Seq a b) = Seq (trim a) (trim b)
> trim (Test a b) = Test (trim a) (trim b)
> trim x = x
Group Properties of Burro Programs
----------------------------------
We assert these first, and when we describe the program semantics we will
show that the semantics do not violate them.
The inverse of e is e: ee = e
The inverse of ! is !: !! = e
The inverse of + is -: +- = e
The inverse of - is +: -+ = e
The inverse of < is >: <> = e
The inverse of > is <: >< = e
If aa' = e and bb' = e, (a/b)(b'/a') = e.
If aa' = e and bb' = e, abb'a' = e.
> inverse Null = Null
> inverse ToggleHalt = ToggleHalt
> inverse Inc = Dec
> inverse Dec = Inc
> inverse GoLeft = GoRight
> inverse GoRight = GoLeft
> inverse (Test a b) = Test (inverse b) (inverse a)
> inverse (Seq a b) = Seq (inverse b) (inverse a)
For every Burro program x, annihilationOf x is always equivalent
computationally to e.
> annihilationOf x = Seq x (inverse x)
State Model for Burro Programs
------------------------------
Central to the state of a Burro program is an object called a tape.
A tape consists of a sequence of cells in a one-dimensional array,
unbounded in both directions. Each cell contains an integer of unbounded
extent, both positive and negative. The initial value of each cell is
zero. One of the cells of the tape is distinguished as the "current cell";
this is the cell that we think of as having the "tape head" hovering over it
at the moment.
In this semantics, we represent a tape as two lists, which we treat as
stacks. The first list contains the cell under the tape head, and
everything to the left of the tape head (in the reverse order from how it
appears on the tape.) The second list contains everything to the right of
the tape head, in the same order as it appears on the tape.
> data Tape = Tape [Integer] [Integer]
> deriving (Read)
>
> instance Show Tape where
> show t@(Tape l r) =
> let
> (Tape l' r') = strip t
> in
> show (reverse l') ++ "<" ++ (show r')
When comparing two tapes for equality, we must disregard any zero cells
farther to the left/right than the outermost non-zero cells. Specifically,
we strip leading/trailing zeroes from tapes before comparison. We don't
strip out a zero that a tape head is currently over, however.
Also, the current cell must be the same for both tapes (that is, tape heads
must be in the same location) for two tapes to be considered equal.
> stripzeroes list = (reverse (sz (reverse list)))
> where sz [] = []
> sz (0:rest) = sz rest
> sz x = x
>
> ensurecell [] = [0]
> ensurecell x = x
>
> strip (Tape l r) = Tape (ensurecell (stripzeroes l)) (stripzeroes r)
>
> tapeeq :: Tape -> Tape -> Bool
> tapeeq t1 t2 =
> let
> (Tape t1l t1r) = strip t1
> (Tape t2l t2r) = strip t2
> in
> (t1l == t2l) && (t1r == t2r)
>
> instance Eq Tape where
> t1 == t2 = tapeeq t1 t2
A convenience function for creating an inital tape is also provided.
> tape :: [Integer] -> Tape
> tape x = Tape [head x] (tail x)
We now define some operations on tapes that we will use in the semantics.
First, operations on tapes that alter or access the cell under the tape head.
> inc (Tape (cell:left) right) = Tape (cell + 1 : left) right
> dec (Tape (cell:left) right) = Tape (cell - 1 : left) right
> get (Tape (cell:left) right) = cell
> set (Tape (_:left) right) value = Tape (value : left) right
Next, operations on tapes that move the tape head.
> left (Tape (cell:[]) right) = Tape [0] (cell:right)
> left (Tape (cell:left) right) = Tape left (cell:right)
> right (Tape left []) = Tape (0:left) []
> right (Tape left (cell:right)) = Tape (cell:left) right
Finally, an operation on two tapes that swaps the current cell between
them.
> swap t1 t2 = (set t1 (get t2), set t2 (get t1))
A program state consists of:
- A "data tape";
- A "stack tape"; and
- A flag called the "halt flag", which may be 0 or 1.
The 0 and 1 are represented by False and True boolean values in this
semantics.
> data State = State Tape Tape Bool
> deriving (Show, Read, Eq)
>
> newstate = State (tape [0]) (tape [0]) True
Semantics of Burro Programs
---------------------------
Each instruction is defined as a function from program state to program
state. Concatenation of instructions is defined as composition of
functions, like so:
If ab is a Burro program, and a maps state S to state S', and b maps
state S' to S'', then ab maps state S to state S''.
> exec (Seq a b) t = exec b (exec a t)
The e instruction is the identity function on states.
> exec Null s = s
The ! instruction toggles the halt flag. If it is 0 in the input state, it
is 1 in the output state, and vice versa.
> exec ToggleHalt (State dat stack halt) = (State dat stack (not halt))
The + instruction increments the current data cell, while - decrements the
current data cell.
> exec Inc (State dat stack halt) = (State (inc dat) stack halt)
> exec Dec (State dat stack halt) = (State (dec dat) stack halt)
The instruction < makes the cell to the left of the current data cell, the
new current data cell. The instruction > makes the cell to the right of the
current data cell, the new current data cell.
> exec GoLeft (State dat stack halt) = (State (left dat) stack halt)
> exec GoRight (State dat stack halt) = (State (right dat) stack halt)
(a/b) is the conditional construct, which is quite special.
First, the current data cell is remembered for the duration of the execution
of this construct — let's call it x.
Second, the current data cell and the current stack cell are swapped.
Third, the current stack cell is negated.
Fourth, the stack cell to the right of the current stack cell is made
the new current stack cell.
Fifth, if x is positive, a is evaluated; if x is negative, b is evaluated;
otherwise x = 0 and neither is evaluated. Evaluation occurs in the state
established by the preceding four steps.
Sixth, the stack cell to the left of the current stack cell is made
the new current stack cell.
Seventh, the current data cell and the current stack cell are swapped again.
> exec (Test thn els) (State dat stack halt) =
> let
> x = get dat
> (dat', stack') = swap dat stack
> stack'' = right (set stack' (0 - (get stack')))
> f = if x > 0 then thn else if x < 0 then els else Null
> (State dat''' stack''' halt') = exec f (State dat' stack'' halt)
> (dat'''', stack'''') = swap dat''' (left stack''')
> in
> (State dat'''' stack'''' halt')
We observe an invariant here: because only the (a/b) construct affects the
stack tape, and because it does so in a monotonic way — that is, both a
and b inside (a/b) have access only to the portion of the stack tape to the
right of what (a/b) has access to — the current stack cell in step seven
always holds the same value as the current stack cell in step two, except
negated.
Repetition
----------
The repetition model of Burro 2.0 is identical to that of Burro 1.0.
The program text is executed, resulting in a final state, S. If, in
S, the halt flag is 1, execution terminates with state S. On the other
hand, if the halt flag is 0, the program text is executed once more,
this time on state S, and the whole procedure repeats. Initially the
halt flag is 1, so if ! is never executed, the program never repeats.
Additionally, each time the program repeats, the stack tape is cleared.
> run program state =
> let
> state'@(State dat' stack' halt') = exec program state
> in
> if
> not halt'
> then
> run program (State dat' (tape [0]) True)
> else
> state'
Central theorem of Burro
------------------------
We now have established enough definitions to give a proof of the central
theorem of Burro, which is:
*Theorem: The set of all Burro programs forms a group over computational
equivalence under the operation of concatenation.*
As covered in the Burro 1.0 article, a "group over an equivalence relation"
captures the notion of replacing the concept of equality in the group
axioms with the concept of equivalency. Our particular equivalence relation
here is that two programs are equivalent if they compute the same function.
In order to show that a set G is a group, it is sufficient to show the
following four properties hold:
1. Closure: For all a, b in G, ab is also in G.
This follows from the inductive definition of Burro programs.
2. Associativity: For all a, b and c in G, (ab)c ≡ a(bc).
This follows from the definition of concatenation (sequential composition);
it doesn't matter if we concatenate a with b first, then concatenate that
with c, or if we concatenate b with c first, then concatenate a with that.
Either way the result is the same string (or in this case, the same Burro
program.)
3. Identity element: There exists an element e in G, such that for every
element a in G, ea ≡ ae ≡ a.
The instruction e in Burro has no effect on the program state. Therefore
concatenating it to any existing program, or concatenating any existing
program to it, results in a computationally equivalent program.
4. Inverse element: For each a in G, there exists an element b in G such
that ab ≡ ba ≡ e.
This is the key property. We first show that it holds for each element of
the inductive definition of Burro programs. We can then conclude, through
structural induction, that all Burro programs have this property.
1. Since e is the identity function on states, e is trivially its own
inverse.
2. Since toggling the flag twice is the same as not changing it at all,
the inverse of ! is !.
3. By the definitions of incrementation and decrementation, and because
data cells cannot overflow, the inverse of + is -, and the inverse
of - is +.
4. By the definitions of left and right, and because the data tape is
unbounded (never reaches an end,) the inverse of > is <, and the inverse
of < is >.
5. The inverse of ab is b'a' where b' is the inverse of b and a' is the
inverse of a. This is because abb'a' ≡ aea' ≡ aa' ≡ e.
6. The inverse of (a/b) is (b'/a'). (This is the key case of the key
property.) Going back to the definition of (/), we see there are three
sub-cases to consider. Before execution of (a/b)(b'/a'), the data tape
may be in one of three possible states:
1. The current data cell is zero. So in (a/b), x is 0, which goes on
the stack and the current data cell becomes whatever was on the
stack (call it k.) The 0 on the stack is negated, thus stays 0
(because 0 - 0 = 0). The stack head is moved right. Neither a nor
b is evaluated. The stack head is moved back left. The stack and
data cells are swapped again, so 0 is back in the current data cell
and k is back in the current stack cell. This is the same as the
initial configuration, so (a/b) is equivalent to e. By the same
reasoning, (b'/a') is equivalent to e, and (a/b)(b'/a') ≡ ee ≡ e.
2. The current data cell is positive (x > 0). We first evaluate (a/b).
The data and stack cells are swapped: the current data cell becomes
k, and the current stack cell becomes x > 0. The current stack cell
is negated, so becomes -x < 0. The stack head is moved to the right.
Because x > 0, the first of the sub-programs, a, is now evaluated.
The current data cell could be anything — call it k'.
The stack head is moved back to the left, so that the current stack
cell is once again -x < 0, and it is swapped with the current data
cell, making it -x and making the current stack cell k'.
We are now to evaluate (b'/a'). This time, we know the current data
cell is negative (-x < 0). The data and stack cells are swapped:
the current data cell becomes k', and the current stack cell becomes
-x < 0. The current stack cell is negated, so becomes x > 0. The
stack head is moved to the right.
Because -x < 0, the second of the sub-programs, a', is now evaluated.
Because a' is the inverse of a, and it is being applied to a state
that is the result of executing a, it will reverse this state to
what it was before a was executed (inside (a/b).) This means the
current data cell will become k once more.
The stack head is moved back to the left, so that the current stack
cell is once again x > 0, and it is swapped with the current data
cell, making it x and making the current stack cell k. This is
the state we started from, so (a/b)(b'/a') ≡ e.
3. Case 3 is an exact mirror image of case 2 — the only difference
is that the first time through, x < 0 and b is evaluated, thus the
second time through, -x > 0 and b' is evaluated. Therefore
(a/b)(b'/a') ≡ e in this instance as well.
QED.
Driver and Unit Tests
---------------------
We define a few more convenience functions to cater for the execution
of Burro programs on an initial state.
> interpret text = run (parse text) newstate
> main = do
> [fileName] <- getArgs
> burroText <- readFile fileName
> putStrLn $ show $ interpret burroText
Although we have proved that Burro programs form a group, it is not a
mechanized proof, and only goes so far in helping us tell if the
implementation (which, for an executable semantics, is one and the same
as the formal semantic formulation) is correct. Unit tests can't tell us
definitively that there are no errors in the formulation, but they can
help us catch a class of errors, if there is one present.
For the first set of test cases, we give a set of pairs of Burro programs.
In each of these pairs, both programs should be equivalent in the sense of
evaluating to the same tape given an initial blank tape.
For the second set, we simply give a list of Burro programs. We test
each one by applying the annihilationOf function to it and checking that
the result of executing it on a blank tape is equivalent to e.
> testCases = [
> ("+++", "-++-++-++"),
> ("+(>+++</---)", "->+++<"),
> ("-(+++/>---<)", "+>---<"),
> ("(!/!)", "e"),
> ("+(--------!/e)", "+(/)+"),
> ("+++(/)", "---"),
> ("---(/)", "+++"),
> ("+> +++ --(--(--(/>>>>>+)+/>>>+)+/>+)+",
> "+> >>> +(---(/+)/)+")
> ]
> annihilationTests = [
> "e", "+", "-", "<", ">", "!",
> "++", "--", "<+<-", "-->>--",
> "(+/-)", "+(+/-)", "-(+/-)",
> "+(--------!/e)"
> ]
> allTestCases = testCases ++ map nihil annihilationTests
> where
> nihil x = ((show (annihilationOf (parse x))), "e")
Our unit test harness evaluates to a list of tests which did
not pass. If all went well, it will evaluate to the empty list.
> test [] =
> []
> test ((a, b):cases) =
> let
> resultA = interpret a
> resultB = interpret b
> in
> if
> resultA == resultB
> then
> test cases
> else
> ((a, b):(test cases))
Finally, some miscellaneous functions for helping analyze why the
Burro tests you've written aren't working :)
> debug (a, b) = ((a, interpret a), (b, interpret b))
> debugTests = map debug (test allTestCases)
Implementing a Turing Machine in Burro
--------------------------------------
First we note a Burro idiom. Assume the current data cell (which
we'll call C) contains an odd positive integer (which we'll call x.)
We can test if x = 1, write a zero into C, write -x into the cell
to the right of C, with the following construct:
--(F>/T>)<
T if executed if x = 1 and F is executed otherwise. (Remember,
we're assuming x is odd and positive.) To make the idiom hold, we
also insist that T and F both leave the data tape head in the
position they found it. If you are wondering where the zero came
from — it came from the stack.
We now note that this idiom can be nested to detect larger odd
numbers. For example, to determine if x is 1 or 3 or 5:
--(--(--(F>/T5>)<>/T3>)<>/T1>)<
We can of course optimize that a bit:
--(--(--(F>/T5>)/T3>)/T1>)<
Our basic strategy is to encode the state of the Turing machine's finite
control as a positive odd integer, which we will call a "finite control
index." We make sure to always keep the current finite control index
available in the current data cell at the start of each loop, and we
dispatch on its contents using the above idiom to simulate the finite
control. We may use odd integers to encode the symbols on the Turing
Machine's tape as well.
We map the Turing machine state onto the Burro data tape in an interleaved
fashion, where three adjacent cells are used to represent one TM tape
cell. The first (leftmost) cell in the triple contains the finite control
index described above. The second cell is a "junk cell" where we can write
stuff and never care about it again. The third cell contains our
representation of the contents of the TM tape cell. Moving the TM tape
head one cell is simulated by moving the Burro data tape head three cells,
skipping over the interim finite control cell and junk cell.
As we always want to be on an up-to-date finite control cell at the start
of each iteration, we must make sure to copy it to the new tape cell triple
each time we move the TM tape head to a new position. If we are
transitioning to a different TM state as well as moving the TM tape head,
we can even just write in the new state at the new finite control cell.
None of this copying requires intermediate loops, as these value are all
fixed constants. The only subtlety is that we must "erase" any finite
control cell we move off of (set it back to zero) so that we can get it to
the desired value by incrementation and decrementation only. The idiom
given above supplies that functionality for us.
Note that the junk cell is used to store the end result of (/), which
we don't care to predict, and don't care to use again. Note also that
the junk cell in which the value is stored belongs to the triple of the
destination TM tape cell, the one to which the TM tape head is moving
on this transition.
A concrete example follows. We consider the TM tape to be over an
alphabet of two symbols, 1 and 3 (or in fact any odd integer greater
than 1), and the finite control to have three states, denoted 1, 3,
and 5. In addition, state 7 (or in fact any odd integer greater than 5)
is a halt state.
In state 1,
- If the symbol is 1, enter state 3;
- If the symbol is 3, move head right one square, and remain in state 1.
>>--(+++>+>/+<<+++>)<
In state 3,
- If the symbol is 1, write 3, move head left one square, and remain in
state 3;
- If the symbol is 3, move head right one square, and enter state 5.
>>--(+++>+++++>/+++<<<<<+++>)<
In state 5,
- If the symbol is 1, write 3, move head right one square, and remain in
state 5;
- If the symbol is 3, write 1 and enter state 7.
>>--(+<<+++++++>/+++>+++++>)<
Putting it all together, including toggling the halt flag so that, unless
we reach state 7 or higher, we loop through this sequence indefinitely:
!--(--(--(!>/
>>--(+<<+++++++>/+++>+++++>)<
>)/
>>--(+++>+++++>/+++<<<<<+++>)<
>)/
>>--(+++>+>/+<<+++>)<
>)<
It is not a very interesting Turing machine, but by following this
construction, it should be apparent how any arbitrary Turing machine
could be mapped to a Burro program in the same way.
Happy annihilating (for reals this time)!
-Chris Pressey
Cat's Eye Technologies
June 7, 2010
Evanston, Illinois, USA
``` |