Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!news-out.readnews.com!news-xxxfer.readnews.com!news.misty.com!news.iecc.com!.POSTED!nerds-end From: Stefan Monnier Newsgroups: comp.compilers Subject: Re: Self-modifying code, Function pointers & { Safety, Security} Date: Wed, 16 Apr 2014 09:18:24 -0400 Organization: A noiseless patient Spider Lines: 9 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <14-04-014@comp.compilers> References: <14-03-015@comp.compilers> <14-03-052@comp.compilers> <14-04-012@comp.compilers> NNTP-Posting-Host: news.iecc.com Mime-Version: 1.0 Content-Type: text/plain X-Trace: miucha.iecc.com 1397654535 20862 2001:470:1f07:1126:0:676f:7373:6970 (16 Apr 2014 13:22:15 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Wed, 16 Apr 2014 13:22:15 +0000 (UTC) Keywords: theory Posted-Date: 16 Apr 2014 09:22:15 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:1221 > Tha halting problem is solvable for linearly bounded automata. The halting problem is also trivially solvable for languages such as Coq and Agda: in those languages, all functions terminate. Of course, they may take centuries to run to completion, so knowing that they will eventually terminate may not be nearly as useful as one might think. Stefan