From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a00006d3c4735d70 X-Google-Attributes: gid103376,public X-Google-Thread: f849b,b8d52151b7b306d2 X-Google-Attributes: gidf849b,public X-Google-ArrivalTime: 2004-01-11 17:02:43 PST Path: archiver1.google.com!news2.google.com!news.maxwell.syr.edu!newsfeed.media.kyoto-u.ac.jp!newsfeed.icl.net!newsfeed.fjserv.net!newsfeed.freenet.de!eusc.inter.net!cs.tu-berlin.de!uni-duisburg.de!not-for-mail From: Georg Bauhaus Newsgroups: comp.arch.embedded,comp.lang.ada Subject: Re: Certified C compilers for safety-critical embedded systems Date: Mon, 12 Jan 2004 01:02:43 +0000 (UTC) Organization: GMUGHDU Message-ID: References: <3fe00b82.90228601@News.CIS.DFN.DE> <3ff18d4d.603356952@News.CIS.DFN.DE> <1731094.1f7Irsyk1h@linux1.krischik.com> <3ff1b8ef.614528516@News.CIS.DFN.DE> <3FF1E06D.A351CCB4@yahoo.com> <3ff20cc8.635997032@News.CIS.DFN.DE> NNTP-Posting-Host: l1-hrz.uni-duisburg.de X-Trace: a1-hrz.uni-duisburg.de 1073869363 17069 134.91.1.34 (12 Jan 2004 01:02:43 GMT) X-Complaints-To: usenet@news.uni-duisburg.de NNTP-Posting-Date: Mon, 12 Jan 2004 01:02:43 +0000 (UTC) User-Agent: tin/1.5.8-20010221 ("Blue Water") (UNIX) (HP-UX/B.11.00 (9000/800)) Xref: archiver1.google.com comp.arch.embedded:7293 comp.lang.ada:4344 Date: 2004-01-12T01:02:43+00:00 List-Id: In comp.lang.ada Chad R. Meiners wrote: : : "Robert I. Eachus" wrote in message : news:tP2dndMsaLDKEpzd4p2dnA@comcast.com... :> Chad R. Meiners wrote: :> :> > Not always true---we can specify the Halting problem (for a Turing :> > Equavilent machine), but we cannot implement it without an oracle. :> :> Actually not quite true. It is not hard to write a program that :> implements the Halting problem, and for any finite machine, it will :> always return the correct answer. : : This would be a specification for the Halting problem for a bounded Turing : Machine. Are you sure you can say that a program that implements the Halting problem for a bounded Turing machine does not implement the same problem for a Turing machine? Georg