Pure Infinitely Self-Modifying Code is Realizable and Turing-complete
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2018-05-01
|
| Series: | International Journal of Electronics and Telecommunications |
| Subjects: | |
| Online Access: | https://journals.pan.pl/Content/103840/PDF/18_1151-4306-1-PB.pdf |
| _version_ | 1818489197221117952 |
|---|---|
| author | Gregory Morse |
| author_facet | Gregory Morse |
| author_sort | Gregory Morse |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-10T17:01:10Z |
| format | Article |
| id | doaj.art-1347511db80e4e8aac3767abf1a2807b |
| institution | Directory Open Access Journal |
| issn | 2081-8491 2300-1933 |
| language | English |
| last_indexed | 2024-12-10T17:01:10Z |
| publishDate | 2018-05-01 |
| publisher | Polish Academy of Sciences |
| record_format | Article |
| series | International Journal of Electronics and Telecommunications |
| spelling | doaj.art-1347511db80e4e8aac3767abf1a2807b2022-12-22T01:40:34ZengPolish Academy of SciencesInternational Journal of Electronics and Telecommunications2081-84912300-19332018-05-01vol. 64No 2https://doi.org/10.24425/119359Pure Infinitely Self-Modifying Code is Realizable and Turing-completeGregory MorseAlthough 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.https://journals.pan.pl/Content/103840/PDF/18_1151-4306-1-PB.pdfx86x86-64assembly languageself-modifyingcodeturing-completenesscode obfuscation |
| spellingShingle | Gregory Morse Pure Infinitely Self-Modifying Code is Realizable and Turing-complete International Journal of Electronics and Telecommunications x86 x86-64 assembly language self-modifyingcode turing-completeness code obfuscation |
| title | Pure Infinitely Self-Modifying Code is Realizable and Turing-complete |
| title_full | Pure Infinitely Self-Modifying Code is Realizable and Turing-complete |
| title_fullStr | Pure Infinitely Self-Modifying Code is Realizable and Turing-complete |
| title_full_unstemmed | Pure Infinitely Self-Modifying Code is Realizable and Turing-complete |
| title_short | Pure Infinitely Self-Modifying Code is Realizable and Turing-complete |
| title_sort | pure infinitely self modifying code is realizable and turing complete |
| topic | x86 x86-64 assembly language self-modifyingcode turing-completeness code obfuscation |
| url | https://journals.pan.pl/Content/103840/PDF/18_1151-4306-1-PB.pdf |
| work_keys_str_mv | AT gregorymorse pureinfinitelyselfmodifyingcodeisrealizableandturingcomplete |