In wikipedia, Cobham's thesis (or Cobham-Edmonds thesis) states:
computational problems can be feasibly computed on some computational device only if they can be computed in polynomial time
So according to my understanding, Cobham says that all problems that are in class $P$, then there exists a physical device that can solve this problem in short time (or a physical device that people can see the answer in their life-time).
Oded Goldreich's textbook of Computational Complexity states:
Cobham-Edmonds Thesis asserts that the time complexities in any two reasonable and general models of computation are polynomially related.That is, a problem has time complexity t in some reasonable and general model of computation if and only if it has time complexity poly(t) in the model of single-tape Turing machine.
It seems that Goldreich's definition of Cobham's thesis is that all model of computation that solve problems in complexity class P are polynomially related. I don't see any different from Goldreich's definition and the Extended Church-Turing Thesis which the later is not credited to any paper or person as far as I know.
Now can you clarify which definition is true for Cobhams' thesis, Is it by wikipedia definition or by Goldreich's definition? If you don't see any contradiction, then can you explain how these two definitions are related.