Resources on proving algorithms correct?

AI Thread Summary
Resources for proving algorithms correct include "The Art of Computer Programming" by Donald Knuth and "Introduction to Algorithms" by Cormen, Leiserson, and Rivest. The latter is noted for being more accessible and directly aligned with the user's needs. The discussion highlights a lack of formal definitions and resources available online regarding algorithm proofs. Users express frustration with the informality of existing materials and seek more structured guidance. Overall, "Introduction to Algorithms" is recommended as a suitable starting point for formal algorithm proof study.
BicycleTree
Messages
518
Reaction score
0
Where can I find resources on proving algorithms correct? I'm looking for a formal treatment (hopefully I have enough background by now to absorb that). I keep seeing these proofs of algorithms and references to proofs of algorithms but everything is informal and I've never even seen a precise definition of "algorithm."

I can't find much on Google or Mathworld. Judging by the online descriptions of courses about algorithmic proof, there must be plenty of information out there, but it's not very accessible. I'd appreciate any suggestions.
 
Mathematics news on Phys.org
"The Art of Computer Programming" by Donald Knuth.
 
There's also Introduction to Algorithms, Cormen Leiserson and Rivest.
 
Thanks. The Art of Computer Programming looks very good, but it's probably more comprehensive than I'm looking for right now. Introduction to Algorithms looks like it's exactly what I seek.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top