#x86 mov instruction only requirement for Turing completeness: http://www.cl.cam.ac.uk/~sd601/papers/mov.pdf …
-
-
Replying to @JacobTorrey
@JacobTorrey mov still needs a jump; follows straight from the structured program theorem, many OISC examples, see http://www.complex-systems.com/pdf/19-3-5.pdf1 reply 0 retweets 0 likes -
Replying to @daniel_bilar
@daniel_bilar If this is x86, I suppose setting up the page tables & IDT properly would remove the explict JMP requirement1 reply 0 retweets 1 like -
Replying to @JacobTorrey
@JacobTorrey TC is a bit overrated, you can do many things with weaker conditions. My fave: 'ghetto' ROP in 2010 BISC http://trailofbits.files.wordpress.com/2010/04/practical-rop.pdf …1 reply 0 retweets 0 likes
Replying to @daniel_bilar
@daniel_bilar @JacobTorrey We polished that code up and released it on Github as a ruby gem: https://github.com/trailofbits/bisc …
6:41 AM - 19 Sep 2013
0 replies
2 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.