Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Computable isomorphism
open-in-new
<h2 id="theorems">Theorems</h2> <p>By the <a href="/facts/Myhill_isomorphism_theorem/DghCkHLj">Myhill isomorphism theorem</a>, the relation of computable isomorphism coincides with the relation of mutual <a href="/facts/Many-one_reduction/YUKNlYPh">one-one reducibility</a>.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> </p> <ul><li><a href="/facts/Hartley_Rogers%2c_Jr./tQfHl6ad">Rogers, Hartley Jr.</a> (1987), <i>Theory of recursive functions and effective computability</i> (2nd ed.), Cambridge, MA: MIT Press, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-262-68052-1, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=0886890">0886890</a>.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Theorem 7.VI, Hartley Rogers, Jr., Theory of recursive functions and effective computability <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> </ol>