"From Tom's link: 'Machine language; A set of instructions for a specific central processing unit, designed to be usable by a computer without being translated. Also called machine code.'
This is what I meant and what Rick said it was."
What you meant and what Rick claimed is not what I meant, which should be clear to you if you look further down to definitions number 2 and 3, and which should have been clear from the context of my remarks.
"Anyway my point made was that I questioned that the successful simulations in various computer languages do not add proof for the program being run."
A simulation of physical experiment doesn't prove anything except feasibility of the experiment.
"It also doesn't do harm. What I think it does do is demonstrate that Joy's model can be simulated by computer program."
It's more than that. Rick is incorrect that every simulation of a continuous function is a continuous function, and in this forum I gave a *specific* example of a continuous function (Chaitin's constant, the halting probability of a Turing machine) that is *not* transportable to different machine languages. The same algorithm generates different results.
It is a short step of logic from the random coin toss probability one sees in Chaitin's result -- which is not transportable, and Joy Christian's framework that is -- to the hypothesis that the simulation of a continuous function (in nature) is a continuous function (in mathematical analysis). *It's strong evidence* that Joy's model is analytical. Chaitin's number shows that there is randomness in arithmetic; Joy's model points toward the absence of randomness in the foundation of nature. We invented arithmetic (Kronecker's belief notwithstanding); we didn't invent nature.
Best,
Tom