User contributions for Hakerh400

Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

31 January 2024

18 January 2024

1 January 2024

30 December 2023

17 December 2023

14 December 2023

13 December 2023

11 December 2023

8 December 2023

7 December 2023

19 November 2023

18 November 2023

2 November 2023

30 October 2023

23 October 2023

15 October 2023

29 September 2023

  • 18:0118:01, 29 September 2023 diff hist +499 Talk:TransetNo edit summary
  • 05:0105:01, 29 September 2023 diff hist +267 TransetFix grammar, add interpreter
  • 04:5904:59, 29 September 2023 diff hist +635 N Talk:TransetCreated page with "== The "Binary numbers" example == The pattern <code>{[<<>>],[(*),<<>>]}</code> (which is supposed to match character <code>1</code>) also matches the representation of character <code>|</code>. If <code>*</code> is replaced with <code><></code>, the resulting set is <code>{[<<>>],[(<>),<<>>]}</code>, which is the same as <code><<<>>></code>, so the program replaces all occurrences of <code><<<>>></code> with <code>{[<>],[({[<<<>>>],[(<>),<<>>]}),<<>>]}</code>, which al..."

17 September 2023

15 September 2023

14 September 2023

12 September 2023

  • 15:1215:12, 12 September 2023 diff hist +746 N Talk:TetrastackCreated page with "== Language specification == If popping from an empty stack is not allowed, then there is no way to detect the size of the input. Either there must be some special value (such as 0 or -1) at the bottom of stack 0 at the beginning, or some stack must contain the length of the input. Can you please clarify that in the article. Also, regarding the "add cell" in the brainfuck conversion - this invalidates the Turing completeness proof. The correct way would be to store the..."

11 September 2023

1 September 2023

16 August 2023

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)