3 ms·

You don't seem to understand, so heres a whitepaper [1] from Rop Gonggrijp on how to play chess on a Nedap voting computer. And the Nedap machines are special-b

• deleted 13y ago
  [deleted]
  • revelation 13y ago
    Despite the halting problem being unsolvable, formal verification is a huge area in computer science. News flash: you can not formally verify some web app running on Python running on Linux, being fed with input from a gigabit link to the complete outside world. So the idea of using Python for an electric voting machine is dead from the onset, a complete no-starter. (And yes, of course computer languages are inherently more or less secure by themselves, through the simple proxy of allowing programmers to make (or prevent) severe errors. Think C and fixed-size buffers on the stack.)