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

Alan Cox (alan@lxorguk.ukuu.org.uk)
Tue, 1 Sep 1998 11:11:54 +0100 (BST)

> 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)

-
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