Abuse filter log

Abuse Filter navigation (Home | Recent filter changes | Examine past edits | Abuse log)
Jump to navigation Jump to search
Details for log entry 9,630

11:30, 19 January 2026: GUAqwq (talk | contribs) triggered filter 16, performing the action "edit" on Punching machine. Actions taken: Disallow; Filter description: the "User:" must not be hidden on links to userspace (examine)

Changes made in edit

{{infobox proglang
|name=Punching Machine
|paradigms=[[Turing-machine|Turing Machine]]
|author=[[User:GUAqwq]]
|year=[[:Category:2026|2026]]
|class=[[:Category:Turing complete|Turing complete]]
|majorimpl=Unimplemented
}}

'''Punching Machine''' is a variation of [[Turing-machine]]. It has an infinite length tape with left boundary, and has 2 characters only: <code>blank</code> and <code>punched</code>. The amount of states is unlimited.

Like a regular Turing-machine, for each step the machine runs, it checks the current cell, overwrite the cell, go left or right, and change its state. What's unique to the Punching Machine is that it ''cannot'' set a <code>punched</code> cell back to <code>blank</code>, since you can't recover a damaged tape.

==Turing-completeness==
Punching Machine is [[Turing-complete]]. I have discovered a truly marvelous proof of this, which this margin is too narrow to contain. Write yours if you have one, or just wait for me. [[User:GUAqwq|GUAqwq]] ([[User talk:GUAqwq|talk]]) 11:28, 19 January 2026 (UTC)

Action parameters

VariableValue
Edit count of the user (user_editcount)
241
Name of the user account (user_name)
'GUAqwq'
Age of the user account (user_age)
74383344
Page ID (page_id)
0
Page namespace (page_namespace)
0
Page title (without namespace) (page_title)
'Punching machine'
Full page title (page_prefixedtitle)
'Punching machine'
Action (action)
'edit'
Edit summary/reason (summary)
''
Old content model (old_content_model)
''
New content model (new_content_model)
'wikitext'
Old page wikitext, before the edit (old_wikitext)
''
New page wikitext, after the edit (new_wikitext)
'{{infobox proglang |name=Punching Machine |paradigms=[[Turing-machine|Turing Machine]] |author=[[User:GUAqwq]] |year=[[:Category:2026|2026]] |class=[[:Category:Turing complete|Turing complete]] |majorimpl=Unimplemented }} '''Punching Machine''' is a variation of [[Turing-machine]]. It has an infinite length tape with left boundary, and has 2 characters only: <code>blank</code> and <code>punched</code>. The amount of states is unlimited. Like a regular Turing-machine, for each step the machine runs, it checks the current cell, overwrite the cell, go left or right, and change its state. What's unique to the Punching Machine is that it ''cannot'' set a <code>punched</code> cell back to <code>blank</code>, since you can't recover a damaged tape. ==Turing-completeness== Punching Machine is [[Turing-complete]]. I have discovered a truly marvelous proof of this, which this margin is too narrow to contain. Write yours if you have one, or just wait for me. [[User:GUAqwq|GUAqwq]] ([[User talk:GUAqwq|talk]]) 11:28, 19 January 2026 (UTC)'
Unified diff of changes made by edit (edit_diff)
'@@ -1,0 +1,15 @@ +{{infobox proglang +|name=Punching Machine +|paradigms=[[Turing-machine|Turing Machine]] +|author=[[User:GUAqwq]] +|year=[[:Category:2026|2026]] +|class=[[:Category:Turing complete|Turing complete]] +|majorimpl=Unimplemented +}} + +'''Punching Machine''' is a variation of [[Turing-machine]]. It has an infinite length tape with left boundary, and has 2 characters only: <code>blank</code> and <code>punched</code>. The amount of states is unlimited. + +Like a regular Turing-machine, for each step the machine runs, it checks the current cell, overwrite the cell, go left or right, and change its state. What's unique to the Punching Machine is that it ''cannot'' set a <code>punched</code> cell back to <code>blank</code>, since you can't recover a damaged tape. + +==Turing-completeness== +Punching Machine is [[Turing-complete]]. I have discovered a truly marvelous proof of this, which this margin is too narrow to contain. Write yours if you have one, or just wait for me. [[User:GUAqwq|GUAqwq]] ([[User talk:GUAqwq|talk]]) 11:28, 19 January 2026 (UTC) '
New page size (new_size)
1044
Old page size (old_size)
0
Lines added in edit (added_lines)
[ 0 => '{{infobox proglang', 1 => '|name=Punching Machine', 2 => '|paradigms=[[Turing-machine|Turing Machine]]', 3 => '|author=[[User:GUAqwq]]', 4 => '|year=[[:Category:2026|2026]]', 5 => '|class=[[:Category:Turing complete|Turing complete]]', 6 => '|majorimpl=Unimplemented', 7 => '}}', 8 => '', 9 => ''''Punching Machine''' is a variation of [[Turing-machine]]. It has an infinite length tape with left boundary, and has 2 characters only: <code>blank</code> and <code>punched</code>. The amount of states is unlimited.', 10 => '', 11 => 'Like a regular Turing-machine, for each step the machine runs, it checks the current cell, overwrite the cell, go left or right, and change its state. What's unique to the Punching Machine is that it ''cannot'' set a <code>punched</code> cell back to <code>blank</code>, since you can't recover a damaged tape.', 12 => '', 13 => '==Turing-completeness==', 14 => 'Punching Machine is [[Turing-complete]]. I have discovered a truly marvelous proof of this, which this margin is too narrow to contain. Write yours if you have one, or just wait for me. [[User:GUAqwq|GUAqwq]] ([[User talk:GUAqwq|talk]]) 11:28, 19 January 2026 (UTC)' ]
Unix timestamp of change (timestamp)
'1768822229'
Retrieved from "https://esolangs.org/wiki/Special:AbuseLog/9630"