Branch Coverage Won’t Prove The Collatz Conjecture

This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.

The Collatz conjecture is the prime example of the limitations of thinking in terms of branch coverage. It can be written as a recursive function in 5 lines of code with only three branches. That’s great, except we have no idea if it’s true or not, and no amount of tests can prove either way.

Read on /collatz-conjecture/ ↗