Talk:Transet

The "Binary numbers" example (Fixed)

The pattern {[<<>>],[(*),<<>>]} (which is supposed to match character 1) also matches the representation of character |. If * is replaced with <>, the resulting set is {[<<>>],[(<>),<<>>]}, which is the same as <<<>>>, so the program replaces all occurrences of <<<>>> with {[<>],[({[<<<>>>],[(<>),<<>>]}),<<>>]}, which also contains <<<>>>, so the program does not terminate. --Hakerh400 (talk) 04:59, 29 September 2023 (UTC)

Thanks for your contribution, but I am not quite understand of the problem you give.{[<<>>],[(x),<<>>]} will not matches {[<<<>>>],[(y),<<>>]} because in this case we won't make x into <>. --GUAqwq (talk) 13:30, 29 September 2023 (UTC)

Re:I see the problem now. --GUAqwq (talk) 15:26, 29 September 2023 (UTC)

Fixed! --GUAqwq (talk) 13:40, 2 October 2023 (UTC)

Personal problem on the interpreter or on haskell (Solved)

(btw I don't know much about haskell and I've met some problem while using your interpreter. If you don't mind, plz help me. I've put the exception on my user page. --GUAqwq (talk) 13:30, 29 September 2023 (UTC))

GHC version 9.4.6 is required, and the project must be compiled from the project directory, not from the repository directory. Open command line, navigate to the project directory (type cd transet) and run ghc Main.hs. It is recommended to use Command Prompt instead of PowerShell. Alternatively, the project can be compiled automatically by double-clicking c.bat. --Hakerh400 (talk) 18:01, 29 September 2023 (UTC)

Thanks, it works now --GUAqwq (talk) 06:52, 2 October 2023 (UTC)

Another proof?

May it can simulate PMMN. The Original Set is

{{{}},{{},{{}}}}

lets use {{}} instead of 1!

1. Inc counter1:{{}}->{{{{}}}}
2. Dec counter1:{{_}}->_ {{{},_}}->{{{}},{{},_}}
3. Inc counter2:{{},_}->{{},{{_}}}
4. Dec counter2:{{},{{_}}}->{{},_} {_,{{}}}->{_,{{},{{}}}}

If we want to do sth when a counter is a value,we can use(use inc c1 when c2 is 0 to be an example):{_,{{},{{}}}}->{{{_}},{{},{{}}}} so c2=0 and other conditions can be a state. Now we can get a structure like this:

n=1
while n{
n=0
if c1=0{...;n=1}
if c2=1{...;n=1}
//halting
if c1 is a number//Must running
{del c1,c2}
}

so we can get "while" by changing state. Now we can get PMMN.--User:Cycwin