If I was not fooled again by microsoft, mathemical proofs for tricky parallel programing algorithms is what makes 1% of computer programming not for high-schoolers. Namely, high-schooler grade programmers, namely 99%, must trust those algorithms. It is even worse when a programming task is required to perform serious and "accurate" floating point calculations since there, high-school skills won't be enough (need a uni/college maths degree, since the "proof" of accuracy of a calculation is pure maths).
Tricky parallel algorithms need specifically designed mathematical logic to be proven.
For instance: AFAIK, ring buffers management using atomic r/w pointers.
If I was not fooled again by microsoft, mathemical proofs for tricky parallel programing algorithms is what makes 1% of computer programming not for high-schoolers. Namely, high-schooler grade programmers, namely 99%, must trust those algorithms. It is even worse when a programming task is required to perform serious and "accurate" floating point calculations since there, high-school skills won't be enough (need a uni/college maths degree, since the "proof" of accuracy of a calculation is pure maths).
Tricky parallel algorithms need specifically designed mathematical logic to be proven.
For instance: AFAIK, ring buffers management using atomic r/w pointers.