Content deleted Content added
→Origin of enumerable = partial?: Found answer |
→Origin of enumerable = partial?: not conceptually difficult |
||
Line 169:
Okay, found the explanation — in the alternative definition "The set S is the range of a total computable function, or empty.", which in at least {{cite book |last1=Mendelson |first1=Elliott |title=Introduction to Mathematical Logic |date=1987 |publisher=Wadsworth & Brooks/Cole |isbn=0-534-06624-0 |page=259 |edition=3rd}} is taken as the primary definition. The proof that this implies "is the ___domain of a partial recursive function" is straightforward, but the converse is '''very''' difficult. [[Special:Contributions/130.243.94.123|130.243.94.123]] ([[User talk:130.243.94.123|talk]]) 17:33, 25 January 2024 (UTC)
:This isn't the place to discuss it, but actually the proof of the converse is not conceptually difficult. There might be a few details to get past, but the idea is straightforward. If you want to know more, please ask a question on [[WP:RD/Math]]. --[[User:Trovatore|Trovatore]] ([[User talk:Trovatore|talk]]) 19:17, 25 January 2024 (UTC)
| |||