Is Turing machine a programmable machine or Is it like a fixed program computer?
Your regular stored program computer could be compared to the Universal Turing Machine (UTM) in that it can be seen as a multipurpose device. Any concrete UTM, nevertheless, still accepts only one base level language, as does the computer that you are using right now. "On top" of that language, other languages can be encoded, and the fact that programs/machines can be processed as data is what gives computers an enormous range of applications, or even "incarnations", which we have just begun exploring.

To answer your question directly: a TM that is programmable is also "fixed", depending on how you see it. Conversely, a machine doesn't have to be as powerful as the UTM to be considered programmable, in some way. In fact, many (very) useful languages are not Turing equivalent.

Regarding computational languages/machines, the notion that there would be something like a "proto-language", or "proto-machine" is misleading. The mythology that has been built around the general-purpose computer obscures its candid nature. The Universal in "Universal Turing Machine" should not be equated to absolute. It is a proposed definition of universality, mathematical in nature, which has been ever since reinstated, repeatedly, in so many ways that it is impossible to describe exhaustively.