01:10:03 [[Ternary]] M https://esolangs.org/w/index.php?diff=104672&oldid=50898 * PythonshellDebugwindow * (+63) /* External resources */ Categories 01:24:07 Bonfire Peaks has a free demo on steam... been playing it. As far as I can make out, it has 28 levels, one of which is impossible ;-) (well, I haven't solved it yet) 01:29:42 Hmm, I haven't played it since I got back home, but I think I had 28 solved levels. 01:30:22 I didn't really get stuck, though, I don't think I even looked at all the reachable levels. 01:30:36 Which one is impossible? 01:30:43 I think I'd just gotten to the water area. 01:32:32 Crate Expectations, https://int-e.eu/~bf3/tmp/ce.jpg ...I suppose I'll figure it out eventually. 01:34:27 does the full game do anything interesting with the decorations, like the car fairly early on? 01:50:46 I'm not sure, I don't think I've done much more than you! 01:52:27 the water 01:52:39 oops. the demo ends at a bridge near a waterfall 01:53:33 and probably misses some harder to reach areas before that. (I've identified one overworld puzzle but it just leads to some suspiciously empty blocks) 01:55:13 empty blocks... and area, cf. https://int-e.eu/~bf3/tmp/space.jpg 02:18:56 Okay, I figured it out... easy in retrospect. 02:56:32 -!- razetime has joined. 03:27:12 -!- joast has quit (Quit: Leaving.). 03:36:59 -!- razetime has quit (Ping timeout: 260 seconds). 04:01:11 Why was my computer making noise? It seems to be something in the back of the computer. It was making a lot of noise so I cleaned it, and then it was making less noise for a few minutes except some clicking, and now it is making more noise again. The temperature is less than it was before I cleaned it, though. 04:01:53 -!- razetime has joined. 05:28:13 -!- Lord_of_Life_ has joined. 05:28:59 -!- Lord_of_Life has quit (Ping timeout: 260 seconds). 05:29:29 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 05:59:23 -!- Church has joined. 06:03:47 -!- imode has changed nick to decay. 06:21:36 -!- perlbot has quit (*.net *.split). 06:21:52 -!- Franciman has joined. 06:21:59 -!- perlbot has joined. 06:21:59 -!- perlbot has changed hostmask to ~perlbot@perlbot/bot/simcop2387/perlbot. 06:22:01 -!- ^[ has joined. 07:54:20 -!- razetime has quit (Ping timeout: 268 seconds). 08:07:11 -!- Franciman has left (WeeChat 3.0). 08:12:47 -!- Sgeo has quit (Read error: Connection reset by peer). 08:25:10 -!- zzo38 has quit (Ping timeout: 268 seconds). 08:26:09 -!- tromp has joined. 08:26:30 -!- razetime has joined. 09:34:31 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 11:13:50 -!- FireFly has joined. 11:16:09 -!- tech_exorcist has joined. 11:18:48 -!- __monty__ has joined. 11:35:48 -!- Melvar has quit (Ping timeout: 248 seconds). 11:42:54 -!- riv has joined. 12:02:03 -!- Melvar has joined. 12:53:54 -!- tech_exorcist has quit (Remote host closed the connection). 12:54:52 -!- tech_exorcist has joined. 12:56:17 -!- chiselfuse has quit (Ping timeout: 255 seconds). 12:59:53 -!- chiselfuse has joined. 13:34:37 [[Alphaton]] https://esolangs.org/w/index.php?diff=104673&oldid=104320 * ColonelMatthew97 * (+130) 13:37:21 [[Alphaton]] https://esolangs.org/w/index.php?diff=104674&oldid=104673 * ColonelMatthew97 * (+24) 13:37:40 [[Alphaton]] https://esolangs.org/w/index.php?diff=104675&oldid=104674 * ColonelMatthew97 * (-2) 15:08:07 -!- sprout has quit (Ping timeout: 252 seconds). 15:22:48 -!- bgs has joined. 15:46:50 [[Special:Log/newusers]] create * Fasolcabra * New user account 15:49:54 [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=104676&oldid=104633 * Fasolcabra * (+224) /* Introductions */ 15:54:11 -!- tromp has joined. 16:08:47 [[Special:Log/newusers]] create * Asdfqwerguy * New user account 16:09:14 [[Pythile]] N https://esolangs.org/w/index.php?oldid=104677 * Someone668 * (+284) Created page with "'''Pythile''' is a esoteric programming language that is a mix of [https://en.wikipedia.org/wiki/Python_(programming_language) Python] and a [https://en.wikipedia.org/wiki/File_system file system]. There is no compiler for the language and it has no real purpose. PLE 16:23:39 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 16:32:38 -!- tromp has joined. 16:39:32 -!- sprout has joined. 16:58:07 -!- Sgeo has joined. 17:14:34 -!- joast has joined. 17:22:26 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 17:29:00 -!- razetime has quit (Remote host closed the connection). 18:19:18 -!- tromp has joined. 18:22:50 -!- Church has quit (Ping timeout: 240 seconds). 18:32:28 -!- Thedarkb-Desktop has joined. 18:38:44 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 18:43:18 -!- zzo38 has joined. 18:49:02 -!- tech_exorcist has quit (Quit: bbl). 18:58:39 -!- Church has joined. 19:05:21 -!- tech_exorcist has joined. 19:22:39 -!- tech_exorcist has quit (Remote host closed the connection). 19:23:02 -!- tech_exorcist has joined. 19:23:02 -!- tromp has joined. 19:35:30 -!- FreeFull has joined. 20:36:25 `olist 1270 20:36:27 olist : shachaf oerjan Sgeo FireFly boily nortti b_jonas 20:36:44 `unlist 20:36:44 unlist? No such file or directory 20:45:08 -!- sprout has quit (Read error: Connection reset by peer). 20:45:25 -!- sprout has joined. 21:08:48 -!- bgs has quit (Remote host closed the connection). 22:14:39 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…). 22:21:28 -!- FreeFull has quit. 22:34:23 -!- earend1 has joined. 22:55:36 -!- tech_exorcist has quit (Quit: Disconnecting). 23:16:36 -!- __monty__ has quit (Quit: leaving). 23:29:22 Huh, wait a minute. You can do n+p linear codes where n+p is bigger than the number of points in your field? 23:32:17 BCH codes over GF(2^m) are linear codes over GF(2) 23:33:05 or is that wrong? 23:33:16 nah, that's right 23:33:34 Hmm, so there's certainly an upper bound to the number of parity shards you can generate, right? 23:33:51 If you have a systematic code and your shards are one bit each, then you can only generate one parity shard. 23:34:02 also, replication is a linear code 23:34:44 That's true. I guess I mean if you have more than one data shard. 23:35:01 There's no n+2 code (linear or otherwise) where your shards are single bits. 23:36:06 heck, padding with 0s is a linear code. 23:36:17 it won't do you any good for error detection or correction 23:36:41 Yes, I mean an erasure code where any subset of n shards will let you recover the data. 23:38:23 But I'm still confused. 23:38:47 Maybe because I was thinking in terms of fitting a polynomial? 23:39:12 So, we're talking about nk + 2k, k being the shard size? And we're asking how big k has to be? 23:39:18 I have a linear 3+3 erasure code over GF(4), i.e. a 6x3 matrix where every subset of 3 rows is invertible. 23:40:07 For a BCH code you clearly need 2^k >= n+2 here. 23:40:10 (And where the first 3 rows are the identity matrix, i.e. it's systematic.) 23:41:13 Hmm, never mind the identity matrix for now. 23:41:24 Right, that bit isn't critical. 23:41:47 The point is that any choice of 3 rows is linearly independent. 23:47:50 So divorcing this from the field... we can replace the field elements by kxk matrices? So encoding becomes multiplication by a matrix with nx(n+2) block of size kxk? 23:49:17 Not sure whether that view is any help at all. 23:54:01 Oh, however... the existence of an 1+2 code (trivial as that may be) shows that BCH codes do not tell the full story. 23:55:54 Do BCH codes give you an n+1 code for any n? 23:56:33 They don't do that either. 23:57:13 Right. 23:59:00 I guess "nk + 2k" is bad notation for denoting sharding... maybe a better notation would be (n + 2)k. The point is... we're picking subsets from whole shards. 23:59:07 s/from/of/