Talk:Decidability theory
Whoa?
[change source]"Thereis also an algorithm. The algorithm will simply check if the element belongs to the set or not. If the algorithm stops ".--For one thing: an algorithm can be on a piece of paper. In that case (also?), the algorithm arguably does not take any action.--Splitting hairs? Well, at least the text can be improved (by anyone, or myself, if i am not busy fixing other articles). 2001:2020:349:7E25:545D:A12C:100E:81A1 (talk) 05:24, 7 July 2024 (UTC)
An example (section), for the wiki-article?
[change source]Perhaps one can (also) "explain" the theory by giving an easy example: First i will suggest it with some extra bells and whistles, and then it can be made simpler:
So, we have a wikipedia-user that has chose a set of natural numbers: "8" and "9", are the only numbers in the set.--The algorithm is a set of instruction, that ... blah-blah .--The finite-amount of time, in regard to the algorithm, we don't have to choose yet.
(Inspired by the lede of the En-wiki version, at this time: "... a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input, terminates after a finite amount of time (possibly depending on the given number) and correctly decides whether the number belongs to the set or not.")--Thoughts? 2001:2020:337:B53F:FCA6:F347:93DC:1426 (talk) 11:21, 7 July 2024 (UTC)