Forte, 66 bytes
Updated for the new Interpreter
2PUT34:LET1=3
4PUT34:END
1PRINT
"2PUT34:LET1=3
4PUT34:END
1PRINT
"
Which, in order is:
1: Print the first half of the code.
2: Print a ", then set line 3 to be line 1.
3: Print the second half of the code again.
4: Print another ", then end the...
I think he's looking at the question I answered to see if it's actually even true, or because he doesn't feel like replying to some message just asking if he exists
@Dennis Wait you are talking about greyed out as in faded right? I think that means that the user has not talked for a while but has had the tab open within the last 2 hours without leaving the room?
IIRC one automatically disappears after 2 hours of having the tab closed
This is false in general.
For example, if $a = -2$ and $b = -1$, we have that $$(-2, 0) = \left(-2, \frac{-2}{\pi}\tan^{-1}{(0)}\right)\subseteq\bigcup_{n\in\mathbb Z}\left(-2, \frac{-2}{\pi}\tan^{-1}(n)\right),$$ which makes the equality impossible.
Yeah ok I don't think SimpleStack is too awful for quining. If anyone writes a quine in it I'll give 50 rep, but let me know if it proves to be more difficult than I expect
Forte, 66 bytes
Updated for the new Interpreter
2PUT34:LET1=3
4PUT34:END
1PRINT
"2PUT34:LET1=3
4PUT34:END
1PRINT
"
Which, in order is:
1: Print the first half of the code.
2: Print a ", then set line 3 to be line 1.
3: Print the second half of the code again.
4: Print another ", then end the...
This is false in general.
For example, if $a = -2$ and $b = -1$, we have that $$(-2, 0) = \left(-2, \frac{-2}{\pi}\tan^{-1}{(0)}\right)\subseteq\bigcup_{n\in\mathbb Z}\left(-2, \frac{-2}{\pi}\tan^{-1}(n)\right),$$ which makes the equality impossible.
