lkml.org 
[lkml]   [1998]   [Sep]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [OFFTOPIC] Re: Virtual Machines, JVM in kernel
> That was precisely my point:  you can have a "proof" which claims "there are 
> no buffer overruns in this code", but you can't verify that proof when
> working in C.

Why? You can have a C program for _generating_ proofs (given that, you would
be able to solve the Halting problem), but I see no reason for verification of
finite proofs about Turing machines being impossible in Turing-complete
languages.

Have a nice fortnight
--
Martin `MJ' Mares <mj@ucw.cz> http://atrey.karlin.mff.cuni.cz/~mj/
Faculty of Math and Physics, Charles University, Prague, Czech Rep., Earth
"ebius tagline. This is a moebius tagline. This is a mo ..."

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu
Please read the FAQ at http://www.tux.org/lkml/faq.html

\
 
 \ /
  Last update: 2005-03-22 13:44    [W:0.386 / U:0.024 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site