3 ms·
According to Ken Thompson's lecture at his Turing Award, you can't: https://www.ece.cmu.edu/~ganger/712.fall02/papers/p761-thompson.pdf https://www.ece.cmu.edu
by verbify 11y ago
According to Ken Thompson's lecture at his Turing Award, you can't:
https://www.ece.cmu.edu/~ganger/712.fall02/papers/p761-thompson.pdf https://www.ece.cmu.edu/~ganger/712.fall02/papers/p761-thomp...
Practically speaking, you can verify that it's unlikely that there is no backdoor, but it'd take a fair bit of effort.
- zachrose 11y agoImpractically speaking, you could singlehandedly reimplement decades of computer engineering starting with a pencil, paper, and a bucket of sand.
- stcredzero 11y agoFrom NAND to Tetris in 12 steps https://www.youtube.com/watch?v=IlPj5Rg1y2w https://www.youtube.com/watch?v=IlPj5Rg1y2w
- ender89 11y agoI prefer placing rocks in an infinite desert to simulate the the flow of data through a computer myself.