How to prove that models of indirect and direct RAM machines are equivalent?












1












$begingroup$


as in the title, I am looking for a formal proof how to show that models of indirect and direct RAM (random-access) machines are equivalent.
I would really appreciate your help.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    This is probably better suited for cs.stackexchange.com or even cstheory.stackexchange.com
    $endgroup$
    – Math1000
    Dec 31 '18 at 21:07
















1












$begingroup$


as in the title, I am looking for a formal proof how to show that models of indirect and direct RAM (random-access) machines are equivalent.
I would really appreciate your help.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    This is probably better suited for cs.stackexchange.com or even cstheory.stackexchange.com
    $endgroup$
    – Math1000
    Dec 31 '18 at 21:07














1












1








1





$begingroup$


as in the title, I am looking for a formal proof how to show that models of indirect and direct RAM (random-access) machines are equivalent.
I would really appreciate your help.










share|cite|improve this question











$endgroup$




as in the title, I am looking for a formal proof how to show that models of indirect and direct RAM (random-access) machines are equivalent.
I would really appreciate your help.







formal-languages turing-machines formal-grammar






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 1 at 14:06









Bram28

63.2k44793




63.2k44793










asked Dec 31 '18 at 18:43









TomasTomas

82




82








  • 2




    $begingroup$
    This is probably better suited for cs.stackexchange.com or even cstheory.stackexchange.com
    $endgroup$
    – Math1000
    Dec 31 '18 at 21:07














  • 2




    $begingroup$
    This is probably better suited for cs.stackexchange.com or even cstheory.stackexchange.com
    $endgroup$
    – Math1000
    Dec 31 '18 at 21:07








2




2




$begingroup$
This is probably better suited for cs.stackexchange.com or even cstheory.stackexchange.com
$endgroup$
– Math1000
Dec 31 '18 at 21:07




$begingroup$
This is probably better suited for cs.stackexchange.com or even cstheory.stackexchange.com
$endgroup$
– Math1000
Dec 31 '18 at 21:07










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3057947%2fhow-to-prove-that-models-of-indirect-and-direct-ram-machines-are-equivalent%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3057947%2fhow-to-prove-that-models-of-indirect-and-direct-ram-machines-are-equivalent%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei