←2023-04-20 2023-04-21 2023-04-22→ ↑2023 ↑all
00:04:22 <esolangs> [[Foreach]] https://esolangs.org/w/index.php?diff=108254&oldid=108253 * Ashli Katt * (+110)
00:06:45 -!- Lord_of_Life has quit (Ping timeout: 240 seconds).
00:07:15 -!- Lord_of_Life has joined.
00:16:44 <esolangs> [[Foreach]] https://esolangs.org/w/index.php?diff=108255&oldid=108254 * Ashli Katt * (+127)
00:20:21 <esolangs> [[Foreach]] https://esolangs.org/w/index.php?diff=108256&oldid=108255 * Ashli Katt * (+150)
00:22:41 <esolangs> [[Language list]] M https://esolangs.org/w/index.php?diff=108257&oldid=108219 * Ashli Katt * (+14)
00:33:57 <esolangs> [[Quassaunt]] N https://esolangs.org/w/index.php?oldid=108258 * BoundedBeans * (+5587) Created page with "Quassaunt is an esolang by [[User:BoundedBeans]] based around sets and reverse-polish notation. ==Data== Everything in Quassaunt is either a set or a string. Variables can only be created as sets, but strings can be on the evaluation stack for the notation, and
00:34:30 <esolangs> [[Quassaunt]] M https://esolangs.org/w/index.php?diff=108259&oldid=108258 * BoundedBeans * (-13)
00:35:07 <esolangs> [[Language list]] https://esolangs.org/w/index.php?diff=108260&oldid=108257 * BoundedBeans * (+16)
00:35:30 <esolangs> [[User:BoundedBeans]] https://esolangs.org/w/index.php?diff=108261&oldid=107588 * BoundedBeans * (+15)
00:41:31 <esolangs> [[Quassaunt]] https://esolangs.org/w/index.php?diff=108262&oldid=108259 * BoundedBeans * (+1)
01:10:35 <esolangs> [[Summatciin]] N https://esolangs.org/w/index.php?oldid=108263 * BoundedBeans * (+9527) Created page with "Summatciin is an esolang by [[User:BoundedBeans]] which depends on summations to do looping. ==Syntax== Parentheses in Summatciin are replaced with double square brackets (just to be different). All statements end when they encounter a double question mark.
01:11:16 <esolangs> [[Language list]] https://esolangs.org/w/index.php?diff=108264&oldid=108260 * BoundedBeans * (+17)
01:11:50 <esolangs> [[User:BoundedBeans]] https://esolangs.org/w/index.php?diff=108265&oldid=108261 * BoundedBeans * (+16)
02:59:40 <orin> What was the name of the language where you can take the union of two arbitrary types to make a type that contains all of the values of both
03:00:17 <orin> Like an untagged union
03:01:09 <orin> so that u8 | i8 makes a type that can represent any number from -128 to 255
03:02:52 <orin> rather than the haskell thing where it's just a tagged union / variant
03:13:12 <zzo38> Is there such a thing?
03:15:37 -!- wpa has quit (Quit: Connection closed for inactivity).
03:28:18 <orin> zzo38 yes, but I can't remember what the name of the language was. it was a "serious" language but basically a dead project
03:42:39 -!- example99 has joined.
03:42:42 <example99> hi
04:58:08 -!- slavfox has quit (Quit: ZNC 1.8.2 - https://znc.in).
05:01:42 -!- slavfox has joined.
05:23:30 -!- bgs has joined.
06:01:03 -!- example99 has quit (Ping timeout: 260 seconds).
06:09:16 -!- chiselfuse has quit (Remote host closed the connection).
06:19:37 -!- chiselfuse has joined.
07:11:37 <b_jonas> orin: well perl has those kinds of integers
08:22:44 -!- Sgeo has quit (Read error: Connection reset by peer).
09:22:40 <river> can the game of life in game of life, simulate any CA?
09:30:57 <river> https://oimo.io/works/life/
09:31:00 <river> wow its infinite
09:31:14 -!- wib_jonas has joined.
09:34:02 <FireFly> sure, I mean it's Turing-complete
09:34:20 <FireFly> and yeah, there's a metalife cell so you can certainly do GoL in GoL
09:34:22 <int-e> for 2D CAs there's this concept https://conwaylife.com/wiki/Unit_cell
09:35:16 <river> how many of the 2d CAs are turing complete?
09:35:35 <river> i guess there is.. (2^8)^2 in total? not factoring out symmetry
09:36:32 <int-e> Hard to say. Do you only count neighbours? That would be 2^18
09:37:04 <int-e> Or do you consider the whole neighbourhood as a pattern? That bumps you to 2^2^9 = 2^512
09:37:06 <river> ok lets only count, that's "nicer"
09:37:09 <int-e> And that's just for two colors.
09:37:18 <river> and I think it factors out symmetry for us
09:37:32 <int-e> (it's 9, not 8 because you have 0..8 neighbours that are alive)
09:38:06 <int-e> though maybe you want to avoid a dead cell in dead space coming to life)
09:38:17 <int-e> then it would be 2^17
09:39:28 <int-e> Anyway, people have studied this question but I haven't.
09:40:05 <int-e> I probably know less about GoL than I did 20 years ago :-P
09:40:27 <river> you will be aware that a new spaceship was found only a few years ago
09:40:55 <int-e> Oh I know a few of the more recent highlights, sure. It was a quantitative statement, not a subset relation.
09:41:51 <river> https://en.wikipedia.org/wiki/Day_and_Night_(cellular_automaton)
09:43:01 <int-e> https://conwaylife.com/wiki/Sir_Robin was the first elementary "knightship"
09:43:42 <int-e> (I expect that that's the "new spaceship from a couple of years ago")
09:43:50 <river> omgggg look at it
09:45:00 <river> https://conwaylife.com/wiki/Copperhead i was meaning the copperhead
09:45:22 <river> I did not even know about sir robin
09:46:28 <FireFly> not sure about which 2D CAs are turing-complete, but 1D ones are sufficient (e.g. rule 110 famously)
09:46:48 <wib_jonas> when you was GoL known to be Turing-complete in the 80s, or was it only known to be able to execute arbitrary circuits?
09:46:52 <river> ish..
09:47:24 <wib_jonas> I remember I read an article about GoL before 2000, as well as a book that mentions it, and I think they did say that some kind of universality was proven
09:48:26 <river> > On August 14, 2020, Peter Naszvadi constructed a Rule 110 unit cell in Day & Night, proving the rule Turing-complete
09:48:28 <lambdabot> <hint>:1:13: error: parse error on input ‘,’
09:48:38 <wib_jonas> unrelated, when you were young, did you find it surprising or unintuitive that an English dictionary uses the abbreviation "fml" to mean a formal word, as in a word that you'd use when speaking to strangers, even though it sounds like it means a familiar word, a word that you use when speaking to family
09:48:59 <FireFly> I don't think I've seen that abbreviation used before
09:49:16 <int-e> river: my work on https://esolangs.org/wiki/Bitgrid is more recent :-P
09:49:39 <int-e> (a year old now, hmm. time flies.)
09:49:50 <esolangs> [[Nndstojmp]] https://esolangs.org/w/index.php?diff=108266&oldid=108249 * Kaveh Yousefi * (+844) Introduced an instructions section serving to summarize the parameters' effects.
09:49:53 <river> i remember that! I love the gif
09:50:16 <int-e> river: the fun part being that I targeted GoL and Rule 110.
09:51:14 <esolangs> [[Nndstojmp]] M https://esolangs.org/w/index.php?diff=108267&oldid=108266 * Kaveh Yousefi * (+4) Amended an orthographic mistake by supplementing a missing the.
09:53:17 <int-e> what did I even use for that... Python and `gifsicle`, ah.
09:53:27 <wib_jonas> river: you'd also need some way to lazily spawn the infinite line of cells initialized to the required background pattern before it's Turing-complete, wouldn't you?
09:54:04 <river> oh i dont know
09:54:04 <int-e> (PIL to generate an animated gif; gifsicle to compress it)
09:54:27 <wib_jonas> with these simple cellular automatons, infinite memory is usually the hard part. see Wireworld as case in point, it's designed such that it's easy to map circuits but impossible to make it expand to unbounded memory
09:55:08 <int-e> wib_jonas: it's easier if you allow unit cells; the challenge is to do some sort of replication or expansion into dead space
09:55:21 <wib_jonas> that still applies with GoL, where unbounded memory is possible but harder than just circuits, and I assume it would apply to day and night too
09:55:22 <int-e> (that is why I still don't particularly like the Rule 110 thing)
09:55:46 <wib_jonas> int-e: right, we want to start from a finite pattern
09:56:45 <int-e> Fundamentally, if you start from a repeated nxm pattern, you have encoded a much larger cellular automaton, with nxm-sized macrocells.
09:57:32 <int-e> The rules for that are of course heavily restricted by the original CA, but I do feel that this adds quite a bit of power nonetheless.
09:59:31 <int-e> Bitgrid is a bit special in that you *have to* populate each cell of the grid with behavior anyway. And there's that alternation... it's not really a traditional CA.
10:03:50 <int-e> Well, expansion is *one* challenge. The first challenge is to take something that's usually chaotic, and restrict it so that chaos is heavily localized with expandable regions of regular behavior (ideally, dead space) inbetween.
10:04:30 <int-e> and spaceships to traverse that space... there's a reason why those are so popular :)
10:05:55 <int-e> (probably heavily influenced by the study of GoL... it does serve as a template for other CAs)
10:29:18 -!- __monty__ has joined.
11:04:22 -!- laerling has quit (Ping timeout: 252 seconds).
11:05:09 -!- laerling has joined.
11:38:39 -!- SGautam has joined.
11:40:27 <river> https://tomas.rokicki.com/ impressive
11:40:30 <river> very impressive
12:42:12 <esolangs> [[Foreach]] https://esolangs.org/w/index.php?diff=108268&oldid=108256 * Ashli Katt * (+6)
12:46:48 -!- wib_jonas has quit (Quit: Client closed).
13:12:28 <esolangs> [[Special:Log/newusers]] create * Skip Broke * New user account
13:15:12 <esolangs> [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=108269&oldid=108233 * Skip Broke * (+377)
13:15:57 <esolangs> [[Foreach]] https://esolangs.org/w/index.php?diff=108270&oldid=108268 * Ashli Katt * (+35)
13:16:59 <esolangs> [[Foreach]] https://esolangs.org/w/index.php?diff=108271&oldid=108270 * Ashli Katt * (-203)
13:24:10 <esolangs> [[Foreach]] https://esolangs.org/w/index.php?diff=108272&oldid=108271 * Ashli Katt * (+9)
13:39:17 -!- example99 has joined.
13:39:17 <example99> hi
13:51:41 -!- example99 has quit (Quit: Client closed).
13:58:07 -!- wib_jonas has joined.
14:08:06 -!- SGautam has quit (Quit: Connection closed for inactivity).
14:47:57 -!- ais523 has joined.
14:52:26 -!- Sgeo has joined.
14:59:57 <esolangs> [[Tueue]] https://esolangs.org/w/index.php?diff=108273&oldid=108234 * ChuckEsoteric08 * (+1)
15:20:57 -!- ais523 has quit (Remote host closed the connection).
15:22:11 -!- ais523 has joined.
16:06:49 -!- example99 has joined.
16:06:49 <example99> hi
16:09:38 -!- wib_jonas has quit (Quit: Client closed).
16:11:34 <ais523> hi
16:13:28 <esolangs> [[User:ChuckEsoteric08]] https://esolangs.org/w/index.php?diff=108274&oldid=108235 * ChuckEsoteric08 * (+201)
16:24:05 <esolangs> [[Truth-machine]] https://esolangs.org/w/index.php?diff=108275&oldid=107053 * Example99 * (+116) /* Turth-machine */
16:45:20 <esolangs> [[Selfie]] N https://esolangs.org/w/index.php?oldid=108276 * ChuckEsoteric08 * (+1462) Created page with "'''Selfie''' is self-modifying language by [[User:ChuckEsoteric08]] inspired by [[Muriel]] ==Specification== At the start of the program variables are set to 0 {| class="wikitable" |- | <code>.X.</code> || Output <code>X</code> |- | <code>,X'Y,</code> || Set vari
16:47:02 <esolangs> [[Selfie]] https://esolangs.org/w/index.php?diff=108277&oldid=108276 * ChuckEsoteric08 * (+4)
16:52:28 <esolangs> [[Selfie]] https://esolangs.org/w/index.php?diff=108278&oldid=108277 * ChuckEsoteric08 * (+141)
17:02:43 <esolangs> [[User:ChuckEsoteric08]] https://esolangs.org/w/index.php?diff=108279&oldid=108274 * ChuckEsoteric08 * (+318)
17:14:10 <esolangs> [[Talk:4]] https://esolangs.org/w/index.php?diff=108280&oldid=108032 * ChuckEsoteric08 * (+243)
17:39:06 -!- wpa has joined.
18:11:25 -!- ais523 has quit (Ping timeout: 240 seconds).
18:14:53 -!- example99 has quit (Ping timeout: 260 seconds).
18:15:35 -!- ais523 has joined.
18:29:42 -!- example99 has joined.
18:39:58 -!- example99 has quit (Ping timeout: 260 seconds).
19:08:25 -!- Hooloovoo has quit (Ping timeout: 252 seconds).
19:20:13 -!- Hooloovoo has joined.
19:35:46 -!- Hooloovoo has quit (Ping timeout: 265 seconds).
19:36:41 -!- Hooloovoo has joined.
20:24:01 <esolangs> [[Talk:5D Brainfuck With Multiverse Time Travel]] N https://esolangs.org/w/index.php?oldid=108281 * Tesolang * (+58) Created page with "this is probably the most absurd programming language ever"
21:34:05 -!- Hooloovoo has quit (Ping timeout: 240 seconds).
21:58:04 -!- __monty__ has quit (Quit: leaving).
22:16:48 -!- bgs has quit (Remote host closed the connection).
←2023-04-20 2023-04-21 2023-04-22→ ↑2023 ↑all