Re: Self-modifying code, Function pointers & { Safety, Security}

Stefan Monnier <monnier@iro.umontreal.ca>
Wed, 16 Apr 2014 09:18:24 -0400

          From comp.compilers
Related articles
Self-modifying code, Function pointers & { Safety, Security} seimarao@gmail.com (Seima Rao) (2014-03-07)
Re: Self-modifying code, Function pointers & { Safety, Security} kaz@kylheku.com (Kaz Kylheku) (2014-03-09)
Re: Self-modifying code, Function pointers & { Safety, Security} martin@gkc.org.uk (Martin Ward) (2014-03-14)
Re: Self-modifying code, Function pointers & { Safety, Security} tenger@iseries-guru.com (Terrence Enger) (2014-03-15)
Re: Self-modifying code, Function pointers & { Safety, Security} seimarao@gmail.com (2014-03-20)
Re: Self-modifying code, Function pointers & { Safety, Security} federation2005@netzero.com (2014-04-13)
Re: Self-modifying code, Function pointers & { Safety, Security} monnier@iro.umontreal.ca (Stefan Monnier) (2014-04-16)
| List of all articles for this month |
From: Stefan Monnier <monnier@iro.umontreal.ca>
Newsgroups: comp.compilers
Date: Wed, 16 Apr 2014 09:18:24 -0400
Organization: A noiseless patient Spider
References: 14-03-015 14-03-052 14-04-012
Keywords: theory
Posted-Date: 16 Apr 2014 09:22:15 EDT

> 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

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.