A solution is to use a program for a Turing machine as the model. The length of the program represents the complexity (which measures the choices that form the program). There's different formulations of a turing machine (different languages for programming one), but since any turing machine can be simulated by any other turing machine with a program, the length of that program becomes the error (that represents the difference in complexity introduced by your selection of some specific Turing machine). If you are comparing models using the same turing machine, then this constant difference doesn't matter. a-b = (a+x) - (b+x)
One practical solution is that more data swamps minor differences between the specification language used to describe models. More data is better.
A solution is to use a program for a Turing machine as the model. The length of the program represents the complexity (which measures the choices that form the program). There's different formulations of a turing machine (different languages for programming one), but since any turing machine can be simulated by any other turing machine with a program, the length of that program becomes the error (that represents the difference in complexity introduced by your selection of some specific Turing machine). If you are comparing models using the same turing machine, then this constant difference doesn't matter. a-b = (a+x) - (b+x)
One practical solution is that more data swamps minor differences between the specification language used to describe models. More data is better.