Pure Infinitely Self-Modifying Code is Realizable and Turing-complete
Abstract
Full Text:
PDFReferences
Dolan, S. mov is Turing-complete. Computer Laboratory, University of Cambridge. Technical report (2013)
The M/O/Vfuscator (2015). https://github.com/xoreaxeaxeax/movfuscator
Anckaert B., Madou M., De Bosschere K. (2007) A Model for Self-Modifying Code. In: Camenisch J.L., Collberg C.S., Johnson N.F., Sallee P. (eds) Information Hiding. IH 2006. Lecture Notes in Computer Science, vol 4437. Springer, Berlin, Heidelberg [https://doi.org/10.1007/978-3-540-74124-4_16]
Hongxu Cai , Zhong Shao , Alexander Vaynberg, Certified self-modifying code, ACM SIGPLAN Notices, v.42 n.6, June 2007 [https://doi.org/10.1145/1273442.1250743]
Refbacks
- There are currently no refbacks.
International Journal of Electronics and Telecommunications
is a periodical of Electronics and Telecommunications Committee
of Polish Academy of Sciences
eISSN: 2300-1933