Ahhh, I'm currently reading a book on the Poincaré Conjecture. How about you?
Are you reading about anything as interesting as thr Poincaré Conjecture?
This page is a permanent link to the reply below and its nested replies. See all post replies »
Damascus
Book about computational tree logic (CTL) If engineers used this more often, it would be pretty cool.
TetrisGuy · 26-30, M
Hmm? What's that about? Sounds like recursive logic.
Damascus
Yes, they have similarities .
Predicative logic can't prove stuff like "application will never go into a deadlock situation" or "app will always recover from an error"
But CTL can. It's used in formal verification, which is only used for building space shuttles, intel processors, formulas (racing cars XD), military airplanes etc. cuz it consumes a lot of time. You can tell if your multithreaded app will run into a deadlock or not with 100% certainty using formal verification.
Predicative logic can't prove stuff like "application will never go into a deadlock situation" or "app will always recover from an error"
But CTL can. It's used in formal verification, which is only used for building space shuttles, intel processors, formulas (racing cars XD), military airplanes etc. cuz it consumes a lot of time. You can tell if your multithreaded app will run into a deadlock or not with 100% certainty using formal verification.
TetrisGuy · 26-30, M
I see xD that would be good for compilers and all.