To be fair, naming things is also one of the hard problems in computer science.
Graphs may have vertices or nodes. Traversals of a graph may be called paths and walks or simple paths and paths. The length of a path may be equal to the number of nodes or edges in it. The height of a tree may be equal to the depth of the deepest node, or it may be off by one in either direction.
In my subfield, some people talk about strings and substrings while others talk about words and factors. A Lempel–Ziv compressor may factorize the input or parse it into phrases. The Burrows–Wheeler transform, the FM-index, and the compressed suffix array may all refer to the same thing, or there may be 2 or 3 distinct meanings.
I don't think I've ever written a paper without naming at least one new concept and renaming at least one old concept.
Graphs may have vertices or nodes. Traversals of a graph may be called paths and walks or simple paths and paths. The length of a path may be equal to the number of nodes or edges in it. The height of a tree may be equal to the depth of the deepest node, or it may be off by one in either direction.
In my subfield, some people talk about strings and substrings while others talk about words and factors. A Lempel–Ziv compressor may factorize the input or parse it into phrases. The Burrows–Wheeler transform, the FM-index, and the compressed suffix array may all refer to the same thing, or there may be 2 or 3 distinct meanings.
I don't think I've ever written a paper without naming at least one new concept and renaming at least one old concept.