Colossus printed out the current count only if it exceeded the "set total". There was also a feature for suspending counting and incrementing of the key sequence circuits if a second count needed to be printed before the printer had finished. These are both quite clearly conditional branching. 

The Atanasoff-Berry Computer is usually described as being designed only for the solution of systems of linear equations. Colossus, on the other hand, could perform a wide variety of tasks to help with decrypting Tunny messages. These ranged from implementing "Tutte's 1+2 break-in" to performing a frequency count of the characters in a "delta de-chi".