Turing equivalence: Difference between revisions
Content deleted Content added
No edit summary |
|||
| Line 1: | Line 1: | ||
'''Turing equivalence''' may refer to: |
'''Turing equivalence''' may refer to: |
||
* [[Turing completeness]], having computational power equivalent to a universal Turing machine |
* As related to [[Turing completeness]], [[Turing completeness#Formal_definitions|Turing equivalence]] means having computational power equivalent to a universal Turing machine |
||
* [[Turing degree]] equivalence (of sets), having the same level of unsolvability |
* [[Turing degree]] equivalence (of sets), having the same level of unsolvability |
||
Revision as of 05:53, 9 May 2022
Turing equivalence may refer to:
- As related to Turing completeness, Turing equivalence means having computational power equivalent to a universal Turing machine
- Turing degree equivalence (of sets), having the same level of unsolvability
See also
This disambiguation page lists articles associated with the title Turing equivalence.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.