We've come close!
Chris Pressey
5 years ago
| 408 | 408 | * reset to the main stack |
| 409 | 409 | * continue conditionally |
| 410 | 410 | |
| 411 | Is this it? | |
| 412 | ||
| 413 | > | 0^^^^^ | |
| 414 | > | (<0^'S:<:0v\:v:)'% | |
| 415 | > = -2:[1] | |
| 416 | > = -1:[5] | |
| 411 | Is this it? With n=5: | |
| 417 | 412 | |
| 418 | 413 | | 0^^^^^ |
| 419 | | (<0^'S:<:0v\0 | |
| 414 | | (<0^'S:<:0v\Y:v:)'% | |
| 420 | 415 | = -2:[1] |
| 421 | = -1:[5] | |
| 422 | ||
| 423 | OK. Let's try implementing it in small bits, then put them all together. | |
| 424 | ||
| 425 | We demonstrate (with an initial n=5) that we can move _n_ to the | |
| 426 | "data stack" (stack -1), then put a 1 on the "garbage stack" | |
| 427 | (stack -2), | |
| 428 | ||
| 429 | | 0^^^^^ | |
| 430 | | (<0^' | |
| 416 | = -1:[0,1,2,3,4,5] | |
| 417 | = > 0:[#k] | |
| 418 | ||
| 419 | And with n=0: | |
| 420 | ||
| 421 | | 0 | |
| 422 | | (<0^'S:<:0v\Y:v:)'% | |
| 431 | 423 | = -2:[1] |
| 432 | = -1:[5] | |
| 424 | = -1:[0,1,2,3,4,5] | |
| 425 | = > 0:[#k] | |
| 426 | ||
| 427 | Oh no! | |
| 433 | 428 | |
| 434 | 429 | ### Minimality of Oxcart |
| 435 | 430 |