00:25 <sb0> bigger FPGAs will also limit you ;)

00:30 <cr1901_modern> So I've been told...

10:24 <sb0> "It is well-known that the x86 instruction set is baroque, overcomplicated, and redundantly redundant. We show just how much fluff it has by demonstrating that it remains Turing-complete when reduced to just one instruction."

10:25 <sb0> https://github.com/xoreaxeaxeax/movfuscator

11:06 <whitequark> sb0: actually you don't need any instructions at all.

11:06 <whitequark> the page fault handling alone is turing-complete https://github.com/jbangert/trapcc

11:16 <kyak> does it also mean that e.g. all ARM instructions can be reduced to 'mov' instruction?

11:21 <whitequark> kyak: no

11:21 <whitequark> x86 mov can perform register-register transfer, loads, stores, and a bunch of computations

11:21 <whitequark> really it's several dozen almost unrelated instructions

11:22 <kyak> i see

11:23 <kyak> there is a comment in "Other architectures" section of README

11:23 <kyak> which says it should be possible on RISC as well

11:24 <kyak> with some limitations, like only two registers

11:35 <larsc> maybe if you can write to $pc

16:38 <sb0> well, many of those computations are implemented with LUTs or other memory hacks

17:00 <whitequark> sure, but it's still a computation