Re: Virtual Machines, JVM in kernel, hot-swapped kernel

Martin Mares (mj@ucw.cz)
Tue, 1 Sep 1998 11:59:59 +0200

> > Verifying of algorithms is not NP complete as it isn't even algorithmically
> > solvable (as a subtask, you need to solve the Halting problem).
>
> Non turing complete programs are verifiable quite often. BSD BPF code is
> verifiable and compilable pretty much O(N)

OK.

When I wrote "algorithms", I meant the usual meaning according to the Church's
Thesis, i.e. Turing-equivalent 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
"Application WINDOWS caused error 0: `No error' and will be aborted."


-
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.altern.org/andrebalsa/doc/lkml-faq.html