Timeline for Implement a Truth-Machine
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| Nov 9, 2015 at 17:48 | history | edited | mbomb007 | CC BY-SA 3.0 |
added 23 characters in body
|
| Nov 9, 2015 at 6:09 | comment | added | user46915 |
You can get one more byte off by combining subtraction and copying together: ,.+++[->>+<-----<]>>---<-[>.<]
|
|
| Nov 6, 2015 at 21:35 | comment | added | Conor O'Brien | I like it when emoji appear in my code, too. | |
| Nov 4, 2015 at 5:22 | history | edited | mbomb007 | CC BY-SA 3.0 |
edited body
|
| Nov 4, 2015 at 5:17 | comment | added | mbomb007 | @Ray That's the default and is generally assumed. Had I used another implementation, I would've said so. | |
| Nov 4, 2015 at 4:01 | comment | added | Ray | You might want to mention that this assumes 8 bit cells with wraparound on underflow, in case anyone is trying to run it on an interpreter that works differently. | |
| Nov 3, 2015 at 23:34 | comment | added | cardboard_box |
Attempted a solution with mod 2. Definitely looks like subtracting 48 is the right way to go. ,.[->+>+<<]>>[->[>-<[-]]>+[<+>-]<<]>[<<.>>]
|
|
| Nov 3, 2015 at 23:10 | history | edited | feersum | CC BY-SA 3.0 |
use correct case, since the stack snippet is case-sensitive
|
| Nov 3, 2015 at 21:56 | history | edited | mbomb007 | CC BY-SA 3.0 |
added 30 characters in body
|
| Nov 3, 2015 at 21:53 | comment | added | Ethan |
You can shorten it a bit more by merging the pieces of code together a bit better and directly using your input register instead of having a separate "48" register: ,.[>+>+<<-]-[>-<-----]>+++[>.<]
|
|
| Nov 3, 2015 at 21:42 | history | edited | mbomb007 | CC BY-SA 3.0 |
added 122 characters in body
|
| Nov 3, 2015 at 19:14 | history | edited | mbomb007 | CC BY-SA 3.0 |
added 29 characters in body
|
| Nov 3, 2015 at 19:13 | comment | added | mbomb007 | @ThomasKwa I'm guessing not, but I'm not sure since I don't see an algorithm specifically for modulo 2. The divmod algorithm is a little long. | |
| Nov 3, 2015 at 19:09 | history | edited | mbomb007 | CC BY-SA 3.0 |
added 104 characters in body
|
| Nov 3, 2015 at 18:22 | history | answered | mbomb007 | CC BY-SA 3.0 |