Talk:Snowflake

From Esolang
Jump to navigation Jump to search

If before the abbreviation the program was +[+1]-[+2]+[+3], will it turn into +[+1] or +[+3]? Orisphera (talk) 19:16, 13 July 2020 (UTC)

Problems w/ FORK and SPOON

I have several questions about FORK and SPOON: Orisphera (talk) 08:26, 28 June 2020 (UTC)

  • Are threads that are created and ones that become shiny/shabby while processing other shiny/shabby threads processed? I assume they aren't, as that would lead to infinite loops.
  • Are threads that become shiny while processing shabby threads processed in SPOON?
  • What happens when the parent of a shiny thread has an empty stack and when its stack top element has not enough elements in SPOON?

I also found some cases where the SPOON-FORK combination seems to have effect: Orisphera (talk) 08:26, 28 June 2020 (UTC)

  • The combination of SPOON and then FORK changes the top elements of the stacks of decrepit threads with shiny children
  • When a decrepit thread has shiny children and there are less of them than of the elements of its top stack element new shiny threads are generated when doing SPOON and then FORK
  • When a shiny/shabby thread has a shiny/shabby child the behavior of the SPOON-FORK combination depends on the order in which they are processed in SPOON:
    • If the parent is processed first, the child now has no parent
    • If the child is processed first, it vanishes
  • If a shiny thread has a tarnished parent, the parent becomes decrepit
All the changes in FORK and SPOON are meant to happen simultaneously.
There are also some invariants about what threads can be parents of what, and what their threads can be. Shabby and decrepit threads always have empty stacks; a decrepit thread cannot have shiny children (only shabby children). It think those invariants mean that the reversal-asymmetries you mention can't apply? --ais523 19:02, 1 July 2020 (UTC)
I think the invariants should be stated explicitly. Orisphera (talk) 19:16, 13 July 2020 (UTC)
Also, here is a case that can happen, e. g. let's say the program is +1-4+4 so before -4+4 the parent of the only shiny thread has the stack [+1] and after -4+4 it has the stack [+[+1]] Orisphera (talk) 19:16, 13 July 2020 (UTC)
Also, after +4+4+4 there will be a decrepit thread with a decrepit (not shabby) child Orisphera (talk) 07:31, 19 July 2020 (UTC)

Is there a version of this without interpreter-self-modification?

Title is the question --(this comment by Joaozin003 at 17:20, 2 March 2023‎ UTC; please sign your comments with ~~~~)

As far as I know, there isn't (or even with the self-modification). --ais523 02:38, 15 March 2023 (UTC)

Segmented transposition

I was making an interpreter, and while testing it I noticed that segmented transposition isn't self-inverse for lists containing +0 or -0, for example

+[+2+2+2-0-3-3]
+[+3+3-2-2-2]
+[+2+2+2-3-3]

I just made it do nothing similarly to same polarity and same number of lists/elements per list. -PkmnQ (talk) 10:19, 17 October 2023 (UTC)