DaWei

The fact that the hardware implementation of your system's memory isn't infinite doesn't mean that your system architecture can't deal with infinite memory. It just means you haven't accomplished it. Same for your language. I think you're thinking that "Turing Language" is something it isn't, in terms of expressing operations on a machine.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

Klipt

Ok, well, according to http://en.wikipedia.org/wiki/Turing_machine the Turing machine is just a state machine, and it's the transitions between states that determine how it treats it's 'input'. But with the correct setup it can read and execute programs just like a processor. So given that particular Turing state machine the transitions would define a language in which programs could be written.

Not a single language, but an infinite family of possible languages depending on the Turing machine's state diagram. Is that what you meant?

DaWei

In my view, the transitions define the operation/meaning. A language merely assigns a way to express those.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers