←2025-03-13 2025-03-14 2025-03-15→ ↑2025 ↑all
01:22:06 -!- amby has quit (Quit: so long suckers! i rev up my motorcylce and create a huge cloud of smoke. when the cloud dissipates im lying completely dead on the pavement).
02:13:12 <esolangs> [[Sb]] N https://esolangs.org/w/index.php?oldid=153955 * C0ffee * (+728) Created page with "'''sb''' is a stack-based esoteric language. ==Commands== {| class="wikitable" |- ! Command !! Description |- | + || pop a, pop b, push b+a |- | - || pop a, pop b, push b-a |- | * || pop a, pop b, push b*a |- | / || pop a, pop b, push b/a |- | _ || pop a, push -a |- | % || po
05:04:50 -!- mtm has quit (Ping timeout: 248 seconds).
05:06:37 -!- mtm has joined.
07:10:03 -!- Sgeo has quit (Read error: Connection reset by peer).
07:12:33 -!- Lord_of_Life_ has joined.
07:13:27 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
07:13:59 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
07:59:18 -!- craigo has joined.
08:47:11 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153956&oldid=153953 * Stkptr * (+130) /* With pow */
09:40:14 <b_jonas> Another graph theory question. I get a DAG as input, and some arcs are marked as red. The task is to decide if there's a directed loop with at least one red arc in it. This would be easy to solve in quadratic time: for each red arc, do a traversal from the end of red arc to see if there's a path to the start of the same red edge. Can you do it in quasi-linear time? Or give a heuristic why that is
09:40:20 <b_jonas> probably impossible? The DAG is represented sparse, with a list of arcs, rather than a dense matrix.
09:40:55 <b_jonas> This isn't something I need in practice right now, because I want to do it for small DAGs with very few red edges, I'm just curious.
09:42:55 <esolangs> [[Talk:General blindfolded arithmetic]] N https://esolangs.org/w/index.php?oldid=153957 * Ais523 * (+832) Blindfolded Arithmetic with arbitrarily many variables and without division is probably equivalent to Imprecision
09:43:14 <b_jonas> Oh, I'm stupid
09:43:42 <b_jonas> for two reasons
09:43:58 <b_jonas> firstly, I wrote DAG where I was thinking of any digraph,
09:44:45 <b_jonas> second because it's obviously possible, you just have to use the well-known quasi-linear time traversal algorithm to find the strongly connected components of the digraph and then check if any red edge has its endpoints in the same strong components
09:44:59 <b_jonas> so question cancelled
09:47:16 <sprout> good try though
09:49:00 <b_jonas> I mean my previous try for a graph theory question turned out to be not so trivial
10:44:36 -!- ais523 has joined.
10:44:51 <ais523> b_jonas: I was going to tell you how to solve that graph problem but you found the same solution as me on your own
10:45:12 <ais523> (decompose into strongly connected components then check the red edges to see if their endpoints are in the same component)
10:51:39 <APic> Hi *
11:00:04 <esolangs> [[Xkcd 1537]] M https://esolangs.org/w/index.php?diff=153958&oldid=153925 * PrySigneToFry * (+90)
11:18:41 -!- sprock has quit (Ping timeout: 248 seconds).
11:25:31 -!- sprock has joined.
11:28:35 -!- amby has joined.
11:37:34 <esolangs> [[User:I am islptng/My ideas]] https://esolangs.org/w/index.php?diff=153959&oldid=153910 * PrySigneToFry * (+176)
12:02:28 -!- sprock has quit (Ping timeout: 245 seconds).
12:09:20 -!- sprock has joined.
15:28:07 <esolangs> [[CJKGolfer]] N https://esolangs.org/w/index.php?oldid=153960 * PrySigneToFry * (+14957) Created page with "CJKGolfer is designed by PSTF, which is inspired from [[Sclipting]]. = Most basic syntax = == Execution == CJKGolfer has a stack, and infinity amount of variables. Many of the instructions are based on stack. == Data types == # Numbers(). Every real numbers
15:29:22 <esolangs> [[Language list]] https://esolangs.org/w/index.php?diff=153961&oldid=153943 * PrySigneToFry * (+76)
15:44:02 <korvo> b_jonas: So, yes, Tarjan's SCC algorithm will do it. But what if the number of red edges is relatively low and the graph is relatively big and well-connected? Then the algorithm might not be linear in the number of red edges, except as a bound.
15:44:04 -!- ais523 has quit (Ping timeout: 260 seconds).
15:45:15 <korvo> You could fix that by building each SCC from a single red edge. That only requires tracking as many connected components as red edges, at most. The algorithm can exit early once all such components are found.
15:45:51 <korvo> ...Sorry, I shouldn't talk so rudely.
15:48:13 -!- ais523 has joined.
16:07:01 -!- craigo has quit (Quit: Leaving).
16:08:33 -!- craigo has joined.
16:21:46 <esolangs> [[Beefydie]] https://esolangs.org/w/index.php?diff=153962&oldid=140376 * Win7HE * (+4) /* Other languages */
16:38:50 <esolangs> [[User:Hotcrystal0]] https://esolangs.org/w/index.php?diff=153963&oldid=153867 * Hotcrystal0 * (+3)
16:46:43 <esolangs> [[General blindfolded arithmetic]] M https://esolangs.org/w/index.php?diff=153964&oldid=153956 * Stkptr * (+4) /* With pow */
16:57:51 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153965&oldid=153964 * Stkptr * (+797) /* with +, -, *, / (at least FSM) */
17:04:12 -!- mtm has quit (Ping timeout: 268 seconds).
17:07:07 -!- mtm has joined.
17:31:00 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153966&oldid=153965 * Stkptr * (+203) /* Immediately Turing complete additions */
17:37:12 <int-e> `unidecode 𝝅
17:37:14 <HackEso> ​[U+1D745 MATHEMATICAL BOLD ITALIC SMALL PI]
17:39:45 <esolangs> [[UClang*]] https://esolangs.org/w/index.php?diff=153967&oldid=115096 * Stkptr * (+344) It's ambiguously PDA or FSM
17:42:26 -!- craigo has quit (Quit: Leaving).
17:57:05 -!- Sgeo has joined.
17:58:03 <esolangs> [[Talk:General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153968&oldid=153957 * Stkptr * (+371)
18:08:06 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153969&oldid=153966 * Stkptr * (+516) /* with +, -, * (at least FSM) */ preliminary note on rational emulation
18:15:51 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153970&oldid=153969 * Stkptr * (+416) /* Equivalence to with / */
18:19:34 <esolangs> [[Blindfolded Arithmetic]] https://esolangs.org/w/index.php?diff=153971&oldid=149423 * Ais523 * (+37) /* See also */ [[General blindfolded arithmetic]]
18:20:16 <esolangs> [[General blindfolded arithmetic]] M https://esolangs.org/w/index.php?diff=153972&oldid=153970 * Ais523 * (+0) formatting of lede (the bolded words should be the topic that the article is about)
18:31:17 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153973&oldid=153972 * Stkptr * (+541) Languages
18:47:24 <esolangs> [[General blindfolded arithmetic]] M https://esolangs.org/w/index.php?diff=153974&oldid=153973 * Ais523 * (+17) /* Example languages */ Blindfolded Arithmetic has truncated division, but that wasn't mentioned, presumably by mistake
19:00:23 <esolangs> [[PLEASE]] https://esolangs.org/w/index.php?diff=153975&oldid=127092 * Stkptr * (+732) FSA
19:06:55 <esolangs> [[Skound]] https://esolangs.org/w/index.php?diff=153976&oldid=62936 * Stkptr * (+392) PDA
19:17:48 <esolangs> [[PhD]] https://esolangs.org/w/index.php?diff=153977&oldid=81301 * Stkptr * (+19)
20:04:04 <esolangs> [[CN]] M https://esolangs.org/w/index.php?diff=153978&oldid=153942 * Buckets * (+302)
20:07:49 <esolangs> [[Oracle machine]] https://esolangs.org/w/index.php?diff=153979&oldid=153629 * Stkptr * (+185)
20:09:29 <esolangs> [[Language list]] M https://esolangs.org/w/index.php?diff=153980&oldid=153961 * Buckets * (+12)
20:09:57 <esolangs> [[User:Buckets]] M https://esolangs.org/w/index.php?diff=153981&oldid=153944 * Buckets * (+11)
20:10:12 <esolangs> [[Truck]] N https://esolangs.org/w/index.php?oldid=153982 * Buckets * (+1114) Created page with "Truck is an Esoteric programming language created by [[User:Buckets]] in 2024. After all Commands, The Index rotates Upwards or downwards By the digits of e (Excluding '2.'), Upwards if the digit's Decimal place is even, else Downwards for Odd digit decimal place It st
20:34:23 <esolangs> [[User talk:I am islptng]] https://esolangs.org/w/index.php?diff=153983&oldid=153825 * Hotcrystal0 * (+151) /* Discord */ new section
20:43:02 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153984&oldid=153974 * Stkptr * (+109) /* Example languages */
21:15:19 <esolangs> [[Game of Life]] https://esolangs.org/w/index.php?diff=153985&oldid=146673 * Corbin * (+1137) Trying out something new, part one.
21:35:17 <esolangs> [[Pointing]] https://esolangs.org/w/index.php?diff=153986&oldid=153662 * Calculus is fun * (+186) /* Statements */
21:41:21 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153987&oldid=153984 * Stkptr * (+805) /* with +, -, * (at least FSM) */
21:41:42 <esolangs> [[General blindfolded arithmetic]] M https://esolangs.org/w/index.php?diff=153988&oldid=153987 * Stkptr * (+2)
21:44:53 <esolangs> [[General blindfolded arithmetic]] M https://esolangs.org/w/index.php?diff=153989&oldid=153988 * Stkptr * (+3) /* With pow */
21:48:06 <esolangs> [[Game of Life]] https://esolangs.org/w/index.php?diff=153990&oldid=153985 * Corbin * (+100) Trying out something new, part two.
22:01:12 <esolangs> [[Pointing]] M https://esolangs.org/w/index.php?diff=153991&oldid=153986 * Calculus is fun * (+0) /* Statements */
22:07:21 <esolangs> [[Talk:Autism]] https://esolangs.org/w/index.php?diff=153992&oldid=149531 * Calculus is fun * (+208)
22:30:08 <APic> cu
22:36:41 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
22:37:06 <esolangs> [[Game of Life]] https://esolangs.org/w/index.php?diff=153993&oldid=153990 * Corbin * (+2130) /* Complexity class */ Something new, part three. This is a vast improvement on the "oh it's universal" rhetoric, I feel.
22:38:12 -!- tromp has joined.
22:38:58 <esolangs> [[Talk:Game of Life]] https://esolangs.org/w/index.php?diff=153994&oldid=153932 * Corbin * (+232) So it's now a complete joke, right~
22:54:06 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
23:07:34 <b_jonas> hold on. the first esolang I'd ever heard of is not Unlambda or Intercal or Piet or Chef or Brainfuck. it's Conway's Game of Life.
23:08:26 <esolangs> [[User:Aadenboy]] M https://esolangs.org/w/index.php?diff=153995&oldid=153675 * Aadenboy * (-8) /* programming languages */ css sucks sometimes
23:12:33 <ais523> b_jonas: I think it took some time to be recognised as an esolang
23:13:16 <ais523> (and might arguably be a compuational model instead because it didn't have a standard syntax, although I guess you can say "plane tiled with cells containing finitely many live cells" is a syntax in a sense
23:13:18 <ais523> )
23:13:42 <korvo> LMK if I got anything wrong. I tried to be well-sourced about this.
23:15:16 <b_jonas> hmm. I did write a game of life implementation at some point when I was young, but IIRC it didn't have a way to save or load state, only to edit interactively, so it doesn't really count as implementing a "standard syntax"
23:20:25 <b_jonas> though of course in the 80s you could have a cheap personal computers with a BASIC interpreter and interactive editor but no way to save the program on casette or tape, and in the 90s you could have the same with a programmable calculator
23:20:51 <b_jonas> and those BASICs still count as a programming language
23:22:14 <esolangs> [[Special:Log/newusers]] create * Helpeesl * New user account
23:26:44 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=153996&oldid=153989 * Stkptr * (+228) /* Core model */
23:27:14 <esolangs> [[ASMM]] https://esolangs.org/w/index.php?diff=153997&oldid=152954 * Chillaxe * (+132) Introduced C support
23:34:40 -!- ais523 has quit (Quit: quit).
23:44:13 <esolangs> [[Aliquid]] M https://esolangs.org/w/index.php?diff=153998&oldid=153946 * Buckets * (+1618)
23:45:44 <esolangs> [[Aliquid]] M https://esolangs.org/w/index.php?diff=153999&oldid=153998 * Buckets * (-67)
23:48:31 <esolangs> [[General blindfolded arithmetic]] https://esolangs.org/w/index.php?diff=154000&oldid=153996 * Stkptr * (+134)
←2025-03-13 2025-03-14 2025-03-15→ ↑2025 ↑all