Revision as of 04:00, 9 May 2025 edit Nyngwang (talk \| contribs) 437 edits m fix: use italic font for "decidable", since it might cause confusion that is explained in the second paragraph (at the time of this editing). ← Previous edit		Revision as of 19:01, 9 May 2025 edit undo Nyngwang (talk \| contribs) 437 edits →Definitions: fix: both definitions are used in the sentence. (an algorithm from the first, a machine from the second.) Next edit →
Line 16: # A recursive language is a [[formal language]] for which there exists a [[Turing machine]] that [[decider (Turing machine)\|decides]] it. ByOn the ~~second~~other ~~definition~~hand, ~~any~~we can show that a [[decision problem]] ~~can~~is bedecidable ~~shown~~by toexhibiting bea ~~decidable~~Turing bymachine ~~exhibiting~~running an [[algorithm]] ~~for it~~ that terminates on all inputs. An [[undecidable problem]] is a problem that is not decidable. == Examples ==

Recursive language: Difference between revisions