Xref: utzoo comp.lang.c:11333 comp.arch:5498 Path: utzoo!utgpu!water!watmath!clyde!att!oucsace!oucs!wright!bclaus From: bclaus@wright.EDU (Brian Clausing) Newsgroups: comp.lang.c,comp.arch Subject: Re: Self-modifying code Message-ID: <260@thor.wright.EDU> Date: 15 Jul 88 06:41:28 GMT References: <5262@june.cs.washington.edu> Organization: Wright State University, Dayton OH, 45435 Lines: 10 in article <5262@june.cs.washington.edu>, pardo@june.cs.washington.edu (David Keppel) says: > Xref: wright comp.lang.c:8563 comp.arch:4081 [...discussion about self-modifying code. It fouls up caches. It is intellectually unmanageable with current ISPs....] As to the semantics of self-modifying code, isn't it identical to a Turing machine's or am I missing something? Of course, reduction machines, like Turner's combinatoric implementation of SASL, are inherently self modifying. MB Clausing