[ back to Tom 7 Radar ]

p
e
r
s
o
n
a
l
SIGBOVIK 2017: ABC (31 Mar at 12:34)
Hello my bloggies! I back-dated this post because even though I was all set up to post about my SIGBOVIK accomplishments, which this time conveniently occurred in the month of March, I then celebrated SIGBOVIK so thoroughly as to go to bed without actually posting here.

This year's invention is a strange artifact; if you want to experience it with fewest spoilers and have some time, then check out the paper version. I also put together a youtube video, since I like doing that:

SIGBOVIK 2017: Compiling C to printable x86, to make an executable research paper, by tom7
Click for nerd-talkin'


Despite the possibly misleading thumbnail, the video is mostly live-action, as I it after a popular YouTube series called Numberphile. The project doesn't lend itself too well to video, so my feelings won't be hurt if you don't sit through this one. :) I did my best to make the ideas and puzzles fun for people that don't have deep knowledge of this stuff but are interested.

SIGBOVIK was also live-streamed, so for the first time we have a mediocre recording of all the talks if you want to tune in after the fact too. My talk's at 1:22:00, and it's more bite-sized than the above.

Also, I must say: The conference this year was excellent, perhaps the best ever. The conference hall was packed; the overall quality of work was very high; the proceedings is thick with really interesting stuff (interspersed with the requisite juvenilia), and the talks were well-prepared and didn't drag on, thanks partly to the new timer system. It's pretty crazy how this conference has a life of its own now; almost nobody from the original group is organizing or even writing papers for it. We may even be getting to the point where we have to be selective about what we print..???
c
o
m
m
e
n
t
Tristan (192.34.91.243) – 04.03.17 19:48:23
Hey Tom,
Thanks for making the video even if it was over a more difficult topic to video-ify, I greatly enjoyed it as someone starting to delve into assembly (except that I'm starting out writing for the Motorola 68000 not x86). Also, thanks for posting about the recording of your talk, I'll definitely give that a watch. Keep it up and great work as always.
c
o
m
m
e
n
t
Tristan (192.34.91.243) – 04.03.17 19:54:19
Also, your talk starts at 1:22:00 in the SIGBOVIK stream and ends at little before 1:36:00. Just to let you know.

Thanks,
Tristan
c
o
m
m
e
n
t
Tom 7 (pool-74-98-229-167.pitbpa.fios.verizon.net) – 04.03.17 22:44:04
Glad you found the video enjoyable! :) Motorola 68k is a much cleaner architecture than x86; I think it's a better starting point. Hope it's fun :)

It looks like they edited the video to trim off the boring beginning, which is probably why my link was wrong. Fixed, thank you!
c
o
m
m
e
n
t
James Five (Since we're doing that) (208.68.128.90) – 04.04.17 08:52:24
Dammit man, you've always got to make things so fun to watch and look into. Love the video.
c
o
m
m
e
n
t
Nels (172.56.22.58) – 04.04.17 15:20:43
Award-winning?
c
o
m
m
e
n
t
Nels (172.56.22.58) – 04.04.17 15:21:35
Also, 68k is the first assembly language I learned! I thought it was satisfying.
c
o
m
m
e
n
t
Tom 7 (pool-74-98-229-167.pitbpa.fios.verizon.net) – 04.04.17 23:27:06
Thanks James! :)

Nels: Award for "Most Executable." Registered a 0db on the Applause-O-Meter. The true treasure is friendship with your computer.
c
o
m
m
e
n
t
Nels (pool-96-238-5-77.prvdri.fios.verizon.net) – 04.05.17 12:47:38
Gotcha. There used to be a most suspiciously like real research award (probably still is) which you're always in the running for in my mind. Though I tend to equate research with effort...
c
o
m
m
e
n
t
Nels (pool-96-238-5-77.prvdri.fios.verizon.net) – 04.05.17 13:18:44
The Joseph Stalin Award for Excessive Execution
c
o
m
m
e
n
t
N7DOT (159.191.162.254) – 04.18.17 12:41:51
Sorry if I missed something, but... isn't

x or y

equivalent to

(x and y) xor (x xor y)

? I don't see why addition would need to be used for implementing bitwise or, since xor is the same as or (and as addition), if it is given that at most only a single argument can be true/1, which is the case here.

Other than that, though, it's impressive you accomplished this with such tight restrictions. Haven't gotten to watch the video yet though I plan to later... also, haven't finished reading the paper yet...!
c
o
m
m
e
n
t
Tom 7 (pool-74-98-229-167.pitbpa.fios.verizon.net) – 04.18.17 20:40:04
Yep, you're right. A few people have pointed this one out (it's also a prominent blunder in the video), which makes me especially ashamed to have missed it. :)
p
o
s
t

a

c
o
m
m
e
n
t
[ Tom 7 Radar  •  Tom 7 on Google+  •  on Twitter  •  on Facebook ]