TY - JOUR N2 - Although self-modifying code has been shyed away from due to its complexity and discouragement due to safety issues, it nevertheless provides for a very unique obfuscation method and a different perspective on the relationship between data and code. The generality of the von Neumann architecture is hardly realized by today’s processor models. A code-only model is shown where every instruction merely modifies other instructions yet achieves the ability to compute and Turing machine operation is easily possible. L1 - http://journals.pan.pl/Content/103840/PDF/18_1151-4306-1-PB.pdf L2 - http://journals.pan.pl/Content/103840 PY - 2018 IS - No 2 DO - 10.24425/119359 KW - x86 KW - x86-64 KW - assembly language KW - self-modifyingcode KW - Turing-completeness KW - code obfuscation A1 - Morse, Gregory PB - Polish Academy of Sciences Committee of Electronics and Telecommunications VL - vol. 64 DA - 2018.05.15 T1 - Pure Infinitely Self-Modifying Code is Realizable and Turing-complete UR - http://journals.pan.pl/dlibra/publication/edition/103840 T2 - International Journal of Electronics and Telecommunications ER -