Related changes
Jump to navigation
Jump to search
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are in bold.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
17 December 2025
|
|
N 16:56 | Turing completeness 6 changes history +772 [RobinCodes; Sligocki (2×); Azerty (3×)] | |||
|
|
16:56 (cur | prev) +15 Sligocki talk contribs (→List of Turing-complete systems: Add Fractran) Tag: Visual edit | ||||
|
|
16:54 (cur | prev) +79 Sligocki talk contribs (Link several of these discussed on the wiki) Tag: Visual edit | ||||
| m |
|
14:01 (cur | prev) −1 RobinCodes talk contribs (grammar fix) Tag: Visual edit | |||
|
|
10:12 (cur | prev) +10 Azerty talk contribs Tag: Visual edit | ||||
|
|
09:56 (cur | prev) +50 Azerty talk contribs Tag: Visual edit | ||||
| N |
|
09:35 (cur | prev) +619 Azerty talk contribs (Created page with "A Turing-complete system is a system that can compute every computable functions. A Turing-complete system can be used to simulate any Turing machine or other Turing-complete systems. The halting problem is uncomputable on any Turing-complete system. To be Turing-complete, a system must be able to store unbounded memory, access it and must contain non-halting programs (like "while" loops or recursion). === List of Turing-complete systems === This list is non-exhaustiv...") Tag: Visual edit | |||