Well, the fact is that binary values are much easier to handle technically that ternary values. And there are reasons for it. So if there was some technical breakthrough where suddenly ternary values become easy to handle, there would be a good reason to believe that binary values would have a similar breakthrough very soon.
So yours is a purely hypothetical question. And you are making assumptions about how people would react in a purely hypothetical situation.
In lots of situations, for many algorithms, binary or ternary doesn't matter. At a high level, we just talk about integers. But for many basic operations, ternary is at a disadvantage. Design a format for signed integers. Preferably one where the same representation is used for positive signed integers and for unsigned integers. You have a problem unless you use one trit and use it as a sign bit. Which means you now have a representation where not every trit value is valid.
Floating-point arithmetic: I don't remember if it was Knuth and Kahan who showed that "round to nearest even" has some very nice properties, and then showed that you have these nice properties whenever the floating-point base is 8k + 2 (including binary and decimal, what a luck) but not for base 3.
Design the logic for a full-adder. Two inputs from 0 to 2 and one input 0 or 1 (the carry from the previous operation). Quite complicated. Much much more complicated than binary. Going one level down, is there anything like NAND and NOR for trits that can serve as the basis of all logical operations? Try creating a fast multiplier. For binary, the basis for this is an operation which produces x*0 or x*1. Now you need something that produces x*0, x*1 or x*2. Wait, that can't be stored in a single trit. Trouble. Plus you can't use the ordinary full adder to finish off the fast multiplier.
