Talk:Computable isomorphism

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Mathematics Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Low	This article has been rated as Low-priority on the project's priority scale.

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

Is there a standard symbol for this relation? Like isomorphism-subscript-c? —Preceding unsigned comment added by 128.100.216.124 (talk) 20:00, 27 April 2011 (UTC)Reply

In the context of computability theory two sets

A;B\subseteq \mathbb {N}

which are recursively isomorphic are often denoted

A\equiv B

. But this may be confused with the symbol of the congruence relation on the set of integers. -- 86.56.98.28 (talk) 22:55, 28 May 2013 (UTC)Reply

This page was redesigned at the edge.