02:30:45 <de67_> hi
02:36:53 <PkmnQ> de67 and/or de67_: 17:24:20 <PkmnQ> i.e. does ^ concatenate to the rest of the program (i.e. "string"^program -> stringprogram) or is it considered separate (i.e. "string"^program -> string THEN program)
03:29:38 <PkmnQ> oh hiya de67_
03:29:40 <PkmnQ> 02:36:53 <PkmnQ> de67 and/or de67_: 17:24:20 <PkmnQ> i.e. does ^ concatenate to the rest of the program (i.e. "string"^program -> stringprogram) or is it considered separate (i.e. "string"^program -> string THEN program)
03:29:57 <de67_> hi
03:30:34 <PkmnQ> oh lmao I was wondering how the S page wasn't created until you did, turns out it was, you just edited an esolang into the page like I did with Recursive :P
03:30:34 <de67_> it is considered separate
03:30:44 <PkmnQ> alrighty I have to mildly modify the interpreter then
03:31:44 <de67_> PkmnQ: ok
03:38:02 <PkmnQ> and by mildly i mean slightly more thaan mildly but it won't be too bad
03:38:25 <PkmnQ> (also what does "Unmatched double quotes get automatically matched when an instruction is found." mean)
03:47:04 <de67_> PkmnQ: "hello. is the same as "hello".
03:49:21 <PkmnQ> so if the program is "abc."@^"def. it would output only def?
03:53:36 <PkmnQ> lookaheads yay :D r'"[^"]*"|"[^"!^$@.,]*(?=[!^$@.,][^"]*$)|[^"!^$@.,]+'
03:55:07 <de67_> PkmnQ: it would output abcdef
03:56:06 <PkmnQ> de67_: ???
03:56:24 <PkmnQ> how does that not contradict with anything that's been written so far though
03:56:43 <PkmnQ> does it only apply to the . command?
03:56:46 <de67_> oh wait
03:56:50 <de67_> it does output def
03:56:57 <de67_> cuz abc wasnt defined yt
03:56:58 <PkmnQ> alrighty
03:57:23 <PkmnQ> (yeah I'm using @^ as just a fancy way to discard)
06:56:01 <PkmnQ> just gonna put this here for any log readers https://www.youtube.com/watch?v=Q4gTV4r0zRs
06:56:11 <PkmnQ> the combinator rbute forcing a while ago reminded me of it
07:26:30 <yayimheretoo> IM ALL ALONE!!
09:17:04 <KaleidoscopeFive> Back from a place between hell and nothing
09:20:20 <yayimheretoo> i am no longer alone
09:21:44 <KaleidoscopeFive> woah
09:23:00 <KaleidoscopeFive> yayimheretoo: https://en.wikipedia.org/wiki/Zonohedron (idk what that is)
09:23:11 <yayimheretoo> kaleidoscopefive: ok
09:23:19 <yayimheretoo> somefan: progress updates?
09:29:52 <de67_> hey guyz
09:30:07 <yayimheretoo> hi de67_
09:30:10 <yayimheretoo> moi answeredd again
09:30:12 <de67_> hai
09:30:48 <de67_> i see
09:31:13 <yayimheretoo> btw u read the responses right?
09:31:36 <de67_> yayimheretoo: yes i do
09:31:44 <yayimheretoo> de67_: great!
09:32:59 <de67_> housecat
09:33:10 <yayimheretoo> lol
09:33:35 <de67> ok lemme make an another sloplang!!!
09:34:45 <yayimheretoo> yay
09:34:57 <yayimheretoo> btw notify me when new question
09:35:28 <de67> ok
09:44:15 <de67> whar
11:25:15 <yayimheretoo> hallo
11:37:19 <yayimheretoo> btw guys did I miss anythhing while I was gone?
12:08:07 <yayimheretoo> hi PkmnQ!
12:16:36 <de67> hai!
12:16:51 <de67> yayimheretoo: you missed 1 message
12:16:59 <yayimheretoo> de67: which was?
12:17:02 <de67> <de67> whar
12:17:05 <yayimheretoo> llmao
12:17:14 <yayimheretoo> welll how is everybody
12:18:06 <de67> im fine
12:18:08 <de67> what about  you
12:18:14 <yayimheretoo> im great
12:18:21 <de67> also i have esolnag
12:18:22 <de67> idea
12:18:25 <de67> basically
12:18:34 <yayimheretoo> the interviews been really fun, working on sum music, and an scp thung
12:18:36 <yayimheretoo> *thing
12:18:55 <de67> it has program counter like befunge, and the grid tiles an infinite plabe
12:18:59 <de67> there are 2 commands:
12:19:02 <yayimheretoo> oooo
12:19:10 <de67> O -- rotate 90 deg clockwise
12:19:48 <de67> C -- rotate 90 deg clockwise if it has been executed an even amount of times, 90 deg counterclockwise otherwise
12:20:11 <yayimheretoo> oooo
12:20:33 <de67> whats an "oooo"?
12:21:19 <yayimheretoo> oooo as in like oooo thats interesting
12:21:34 <de67> is "oooo" interesting?
12:21:55 <yayimheretoo> ...
12:22:12 <de67> ohhhhhhhhhhhhhhhhhhhhhhh
12:22:14 <de67> i get it now
12:22:21 <yayimheretoo> lmao
12:22:28 <de67> "oooo" is very obviously interesting!
12:22:37 <de67> it has 4 consecutive o's
12:22:42 <de67> which is interesting
12:22:43 <de67> maybe
12:23:15 <yayimheretoo> ᡕᠵデᡁ╾━
12:23:17 <yayimheretoo> lmao
12:24:09 <de67> yayimheretoo: that thing looks like something that is usually used to shoot people
12:24:22 <yayimheretoo> de67: a gun?
12:24:47 <de67> ye
12:24:50 <de67> a gun!
12:25:01 <yayimheretoo> a gun!
12:25:51 <de67> . o O (i find the process of arranging words in a sentence in such a way that it obscures the meaning quite enjoyable)
12:26:16 <yayimheretoo> de67: thats my style of writing when rating stories
12:26:19 <yayimheretoo> *writing
12:26:20 <yayimheretoo> lol
12:28:34 <de67> if you see something shit, but wanna be polite, say this: "hmm yes, this work is for sure quite intriguing"
12:28:44 <yayimheretoo> also dde67 how it going with aadenoy
12:28:51 <yayimheretoo> de67: LMFAO
12:29:00 <de67> 2 questions in and i still dont have a direction
12:29:39 <yayimheretoo> 2 questions is not a lot dw
12:30:16 <PkmnQ> de67: does "it" total all C instructions ever ran, or just that specific one
12:31:05 <PkmnQ> and if it's the latter does a C instruction in one tile count as the same instruction in the other tile (e.g. if the program is 3x3 and there's a C at (1, 1), does the one at (1, 4) count as a separate one)
12:31:34 <de67> PkmnQ: this specific one
12:31:49 <de67> theyre all separate
12:32:18 <PkmnQ> i see, intriguing
12:32:56 <yayimheretoo> de67: oh...
12:33:01 <yayimheretoo> thats fucking hella cool
12:33:08 <yayimheretoo> infinite bounded counters...
12:33:10 <yayimheretoo> that are binary
12:33:17 <yayimheretoo> infinite 1's and 0's
12:33:31 <PkmnQ> i mean it's better to think of them as bits rather than counters right
12:33:41 <PkmnQ> since a 0, 2, 4, 6, etc. is indistinguishable from a 1, 3, 5, 7, etc.
12:33:43 <yayimheretoo> yea
12:33:48 <yayimheretoo> I changed it to 1 and 0's
12:33:49 <yayimheretoo> i.e bits
12:35:02 <PkmnQ> (i really need to write down the proof of Wrong Wrap's Turing-completeness)
12:35:36 <yayimheretoo> lol
12:51:00 <de67> nooooooooooo
12:51:06 <de67> logs.esolangs.org is DOWN
12:51:24 <yayimheretoo> nooooooooooooooo
12:51:43 <de67> btw
12:51:50 <de67> heres a sad poem from esowiki
12:51:54 <de67> that fits the mood
12:51:58 <de67> The world is near its end.
12:52:09 <de67> At the end the sum of all the people stolen from IRC to Discord will be reckoned and the judgement revealed.
12:52:14 <de67> As the domination of Discord ends, perhaps the end itself is a positive thing.
12:52:19 <de67> We are preoccupied with famous esolangs
12:52:26 <de67> And insensitive to the suffering of the new genius creations and attempts to bring attention to them.
12:52:34 <de67> All suggestions on talk pages is for nought, and only hastens our demise.
12:52:38 <de67> For in the end, we are but stardust.
12:52:43 <yayimheretoo> damn
12:53:07 <de67> btw
12:53:18 <de67> its taken from [[Perl]] out of all articles
12:53:27 <de67> and the poem has some links
12:53:38 <de67> and one of them links to YOUR comment on a talk page
12:54:15 <yayimheretoo> *WUT*
12:54:18 <yayimheretoo> *WUUUUUT*
12:54:31 <de67> whar
12:54:36 <de67> whar
12:54:46 <de67> you kissed a message
12:54:48 <yayimheretoo> so confused I pressed history button by accident
12:54:48 <de67> missed*
12:54:55 <yayimheretoo> closing my tab
12:55:27 <de67> . o O (what would kissing a message even mean)
12:58:31 <yayimheretoo> de67: 😘 or 💋
12:59:23 <de67> ok
12:59:33 <yayimheretoo> lol
13:16:11 <de67> hm
13:16:26 <de67> could [[Draft:Stardust]] be tc in its current form?
13:16:38 <yayimheretoo> idk
13:16:47 <yayimheretoo> I feel like the tiling structure is too simple
13:17:08 <yayimheretoo> its only possible to tile one "kind" of program or function or whatever in one pattern
13:17:50 <de67> yayimheretoo: that might be enuff
13:18:01 <yayimheretoo> de67 idk
13:18:09 <yayimheretoo> i dont think it is
13:18:29 <de67> lemme think about it
13:18:33 <PkmnQ> de67: i sure think so
13:18:39 <yayimheretoo> lol
13:18:49 <de67> PkmnQ: think what?
13:18:56 <PkmnQ> i don't know if it'd be harder or easier to prove TC than Wrong Wrap though
13:19:07 <yayimheretoo> where IS wrong wrap
13:19:11 <yayimheretoo> I cannot find it
13:19:21 <PkmnQ> https://esolangs.org/wiki/User:PkmnQ/Wrong_Wrap
13:19:22 <de67> https://esolangs.org/wiki/User:PkmnQ/Wrong_Wrap
13:19:24 <de67> oh damn
13:19:29 <yayimheretoo> lul
13:19:33 <PkmnQ> i haven't moved it out of userspace yet  because i want to prove it TC before doing so
13:19:55 <yayimheretoo> fuckin ok
13:21:49 <de67> adding an instruction that skips next instruction would prolly make it easier to prove that stardust is tc
13:21:58 <yayimheretoo> ye
13:22:07 <yayimheretoo> then you basically get different programs for free
13:22:13 <yayimheretoo> by going in on different angles
13:25:42 <de67> hm
13:26:14 <de67> ais523 may have been the one to prove that the (2, 3) turing machine is universal
13:26:24 <de67> from wikipedia, the free encycopedia: "On 14 May 2007, Wolfram announced a $25,000 prize to be won by the first person to prove or disprove the universality of the (2,3) Turing machine.[2] On 24 October 2007, it was announced that the prize had been won by Alex Smith, a student in electronics and computing at the University of Birmingham, for his proof that it was "universal"."
13:26:38 <yayimheretoo> no it is
13:26:41 <yayimheretoo> im preddi sure
13:30:36 <de67> also
13:30:41 <de67> Stephen Wolfram is 67 years old
13:32:46 <de67> hm, maybe the (6, 2) turing machine what i was looking for all along
13:34:14 <de67> sadly theres no (6, 7) turing machine
13:34:20 <de67> at least a universal one
13:34:30 <de67> that was discovered
13:36:15 <yayimheretoo> how mystical
13:36:25 <yayimheretoo> 2 3 but not 6 7
14:02:06 <PkmnQ> de67: a (6, 2) turing machine is simply a (6, 7) turing machine that doesn't use 5 of its symbols
14:02:28 <PkmnQ> de67: i don't think stardust needs that instsruction
14:02:44 <PkmnQ> de67: also i do remember seeing something that basically confirmed it to me but i don't remember what
14:02:53 <de67> PkmnQ: ok
14:02:58 <PkmnQ> might've been https://esolangs.org/wiki/1cnis
14:03:41 <de67> didnt know that 1cnis even existed
14:04:51 <de67> btw
14:04:54 <de67> confirmed what
14:05:17 <PkmnQ> de67: the thing about the (2, 3) turing machine and ais523
14:05:33 <de67> oh
14:06:53 <de67> how does it confirm that
14:08:28 <PkmnQ> de67: well i think it was that combined with some of the sources from https://en.wikipedia.org/wiki/Wolfram's_2-state_3-symbol_Turing_machine#Dispute
14:08:45 <PkmnQ> unfortunately the archive i remember looking at seems to have disappeared
14:09:12 <de67> also
14:09:33 <de67> a wired article reveals that ais523 was 20 at the time
14:09:40 <de67> so he was born in 1987
14:09:52 <de67> which means that hes 39 now
14:10:54 <PkmnQ> but basically the argument was that the initial conditions of the (2, 3) turing machine encoded some complexity outside of the machine itself, and it's hard to draw a fine line on what would and wouldn't be acceptable
14:11:37 <PkmnQ> i think 1cnis might be ais523's attempt to draw that line
14:11:59 <de67> oh i see
14:12:26 <de67> anyway
14:12:35 <de67> my idea for a turing machine construction:
14:12:42 <de67> cells are encoded using ,
14:13:06 <de67> and the position of the program counter somehow stores the state
14:14:45 <PkmnQ> de67: i mean in this context what's a "," and what does the program look like because this just sounds like a normal turing machine to me
14:15:07 <de67> you should read [[Draft:Stardust]]
14:15:15 <de67> i renamed O to . and C to ,
14:15:20 <de67> cuz lol why not
14:15:29 <PkmnQ> oh you mean a turing machine construction in stardust
14:15:35 <PkmnQ> yeah i understand now
14:15:58 <PkmnQ> but actually this brings to mind Langton's ant, i think i recall that being proven Turing-complete in some way? i don't remember
14:16:35 <de67> PkmnQ: at least in the all-white initial grid, its proven to do the same thing forever
14:16:41 <de67> e.g. halt
14:17:10 <PkmnQ> (it kind of can't halt though, but it does make a looping "highway")
14:17:33 <de67> ye
14:17:44 <de67> doing the same thing forever is to me, the same thing as halting
14:18:25 <PkmnQ> in my opinion it can be used as a replacement for halting in languages without halting, but in languages with halting there's no reason to not just use the language's own halting convention
14:18:43 <PkmnQ> plus there's many different ways of "doing the same thing forever"
14:19:29 <de67> i dont remember langton's ant having a halt state
14:19:35 <PkmnQ> yeah it doesn't
14:19:50 <PkmnQ> perhaps the  useful question to ask here is "is there more than one kind of highway"
14:20:06 <PkmnQ> and the answer is i don't know because i kind of don't know anything about langton's ant
14:20:15 <PkmnQ> other than the blank grid behavior
14:20:27 <de67> me neither
14:20:58 <PkmnQ> but anyway all this to say I think Turmites are underresearched
14:21:09 <de67> mayhaps
14:21:27 <de67> ill go with a turing machine construction instead
14:21:39 <PkmnQ> we have bounds for universal Turing-machines, i don't think we have bounds for universal Turmites
14:22:11 <de67> what kind of bound?
14:23:00 <de67> hm, langton's art with periodic grid initialization might be the easiest thing to construct in stardust if its turing complete
14:23:03 <PkmnQ> (as in we know a 2-state machine needs at most 14 symbols, a 3-state machine needs at most i don't remember the amount symbols, a 4-state machine needs at most 6 symbols, etc. (for a blank tape with a finitely initialized region))
14:23:34 <de67> i see
14:23:42 <PkmnQ> de67: eh i don't know how you'd initialize an infinite amount of cells
14:24:01 <de67> PkmnQ: i wouldnt :3
14:24:05 <PkmnQ> and if it's two different kinds of periodic on two different sides, i'm fairly sure it'd be impossible to
14:24:14 <de67> the program tiles an infinite plane, remember
14:25:03 <PkmnQ> de67: ik but that means you'd need to encode an "initially on" cell and an "initially off" cell in two different ways while still having them behave basically the same in some way
14:25:42 <de67> oh wait
14:25:43 <de67> ye
14:25:46 <de67> i forgor :3
14:31:58 <PkmnQ> wait a minute is Stardust reversible
14:32:09 <PkmnQ> okay it's totally reversible
14:32:14 <de67> whar
14:32:18 <de67> oh wait
14:32:21 <de67> real
14:33:35 <PkmnQ> it's probably still Turing-complete but reversibility is also probably going to make proving it slightly more of a headache :P
14:53:48 <de67> ill go in 67 minutes
15:20:37 <yayimheretoo> hey everybuddy
15:20:38 <de67> hi yayimheretoo
15:20:49 <de67> you missed some stuff
15:20:57 <yayimheretoo> noooooo
15:20:58 <yayimheretoo> lol
15:21:44 <de67> most notably: stardust is reversible and langtons ant is tc
15:21:58 <yayimheretoo> yayyay
15:22:00 <de67> i still have no idea how to prove stardust tc
15:22:12 <yayimheretoo> reversible brainfuck /j
15:22:43 <yayimheretoo> man
15:22:43 <de67> also, i just found this: https://en.wikipedia.org/wiki/Marvin_Minsky#Association%20with%20Jeffrey%20Epstein
15:22:51 <yayimheretoo> dammit!
15:22:52 <de67> i dunno what to do with this information
15:24:06 <yayimheretoo> no
15:24:12 <yayimheretoo> cancel Minsky machines idfk
15:25:31 <yayimheretoo> well thats.. sad
15:25:33 <yayimheretoo> and gross
15:26:17 <de67> (note that these are accusations and there is no proof for or against them)
15:26:50 <de67> but it is still suspicious that Minsky attended the island even after he [J. Epstein] got arrested
15:26:52 <yayimheretoo> ik ik
15:27:29 <de67> also, https://en.wikipedia.org/wiki/Talk:Wolfram%27s_2-state_3-symbol_Turing_machine is surprisingly long
15:27:43 <de67> people decided that the talk page is the perfect place to argue about the proof
15:28:04 <yayimheretoo> lmaoooo
15:28:28 <de67> also we got 2 new n00bs on the esowiki :3
15:28:35 <yayimheretoo> great
15:28:37 <yayimheretoo> hmmm
15:28:46 <yayimheretoo> can I rant I little about esolang ideas
15:28:55 <de67> hopefully well get an another amazing n00b that would ramble about unstructured programming on irc
15:28:59 <yayimheretoo> feel free to shot concepts in when you want
15:29:01 <de67> yayimheretoo: sure!
15:29:08 <yayimheretoo> de67 thhanks!
15:29:10 <yayimheretoo> so
15:29:12 <yayimheretoo> MONADS
15:29:16 <yayimheretoo> i dont like them
15:29:21 <yayimheretoo> because what the fuck is a context
15:29:45 <yayimheretoo> waiiiit
15:29:50 <yayimheretoo> what if you have like a data field
15:29:54 <yayimheretoo> or multiple
15:30:10 <yayimheretoo> like you have on big data field, and then smaller data fields nested within, with certain restrictions
15:30:15 <yayimheretoo> every value has a coordninate
15:30:37 <yayimheretoo> and just moves left every iteration
15:31:34 <yayimheretoo> then like, you could have a monad field. a value which moves when not already a monad into the monad field gets transformed somehow
15:32:06 <yayimheretoo> then it skips over the field in one step
15:32:16 <yayimheretoo> giving extra skip length
15:33:20 <yayimheretoo> well no
15:33:26 <yayimheretoo> thats not really a monad
15:33:44 <yayimheretoo> its that a value cant move out the monad field, other things can move in then out again
15:33:58 <yayimheretoo> if something hits a field wall it cant move through, it bounces and swaps direction
15:37:30 <yayimheretoo> I wonder what happens aa collision
15:39:59 <de67> aa collision?
15:47:16 <yayimheretoo> de67: as in like
15:47:26 <yayimheretoo> a thing is moving left, and another right, and they hit into eac other
15:47:43 <de67> oh is ee
16:00:37 <de67> alr bye guys
16:00:46 <yayimheretoo> nooooo
16:02:00 <PkmnQ> cya
16:42:25 <changerg> whos somefan
16:42:28 <changerg> idk
19:44:08 <KaleidoscopeFive> "<de67> maybe fungot shouldnt have let you of of its basement" <- basement fungot me out of let