00:00:08 -!- Patashu has joined. 00:07:03 -!- hppavilion[1] has joined. 00:07:06 Hellu 00:10:53 hellü hppavilion 00:12:22 what brings you to the chⱥnnel today 00:27:02 @seen Bike 00:27:02 8iKe 00:27:10 well. 00:31:38 @leet Bike 00:31:38 BIk3 00:31:44 @help leet 00:31:44 elite . Translate English to elitespeak 00:31:52 @help seen 00:31:52 help . Ask for help for . Try 'list' for all commands 00:31:56 Yep. 00:32:44 mauris_: Bike hasn't been in this channel in a _long_ time 00:33:03 right now he's not on freenode either 00:33:41 @seen djanatyn 00:33:41 DjAn4+yn 00:33:50 Brb, changing my password to that. 00:34:03 lgtm 00:34:17 is that the moldovan version of jonathan? 00:34:47 THAUSIBLE 00:34:57 (where moldova is any country in europe) 00:35:36 i'm going to learn to write better parsers and interpreters by writing one for this http://pastebin.com/EkCQi6N9 script i designed 00:36:02 what approach do you guys reckon would be best? lex character by character, maybe split and regex matchers or perhaps even a mix of both? 00:36:17 oren: It’s the Lojban version. 00:36:32 (any thoughts on the lang itself is welcome) 00:36:33 molojban 00:36:54 and hi oerjan didnt see you there 00:37:58 I usually write a lexer by scanning each character 00:39:00 i guess doing that and putting each atom in an array tree and interpret that? 00:39:10 -!- Patashu has quit (Quit: Soundcloud (Famitracker Chiptunes): http://www.soundcloud.com/patashu MSN: Patashu@hotmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .). 00:39:54 -!- Patashu has joined. 00:41:55 parsec is the only thing i know how to write parsers with 00:42:10 mauris_: high five 00:43:11 (i _know_ how to do it other ways, in theory.) 00:46:32 mauris_: i'll look into it 00:54:16 I have written other parser before but have used Parsec and Lemon; I have also once converted a recursive descent parser from C into BASIC (as I had no C compiler on the target computer, nor a disk) 00:58:44 well time to hit the hay, i'll sleep on it thanks guys o/ 00:58:46 -!- idris-bot has quit (Quit: Terminated). 01:01:53 -!- idris-bot has joined. 01:03:06 -!- stalem has quit (Ping timeout: 246 seconds). 01:03:15 or air closet, either way works, AC/DC you know <-- i just keep them in the same closet as my vacuum hth 01:05:15 darn bad timing 01:10:53 idris is the worst 01:14:55 I installed the package of "Amoebax" game but I found out that it does not normally let you to set the controls for both players to the same keys, but I found the configuration file and now I can do it anyways, so now I can vers myself; it is difficult because the ghost-block can drop at the different place for each player 01:19:11 Would it be possible for a terminal emulator to fake the "break" function by looking at the termios settings even though normally cannot be used with pseudoterminals? 01:22:15 -!- mauris_ has quit (Ping timeout: 244 seconds). 01:35:33 I have invented syllabic dicentiquinquigentimal 01:36:08 a base 256 number system where each digit has a unique syllable 01:37:29 er, maybe that should be dicentisexiquingentimal? 01:38:25 OK, did you write down all of their working? 01:38:45 the high 4 bits are represented by the start consonant 01:38:49 f p b sp s t d st h k g sk n m l sn 01:39:32 the low four bits are represented by the vowel and end consonant: 01:39:49 a i u e o ya yu yo an in un en on yan yun yon 01:40:15 OK 01:40:32 thus instead of saying eff eff zero zero eff eff 01:40:46 you can say snyan fa snyan 01:42:03 I think I invented something similar once to encode Japanese alphabets, although not all numbers are valid because Japanese alphabets doesn't have that much. 01:52:43 I wonder if it's better for words for digits to be regular or irregular. 01:53:13 What's better: "zero, one, two, three, four, five, six, seven, eight, nine" or "ta, te, ti, to, tu, ba, be, bi, bo, bu"? 01:54:57 I feel like irregular is better. That way, different digits are more dissimilar. 02:01:29 -!- atslash has joined. 02:07:00 -!- Patashu has quit (Ping timeout: 255 seconds). 02:07:55 -!- Patashu has joined. 02:09:34 More wisdom from the neural net: 02:09:57 11:38:23: maybe I don't know what for proofs of memory to be science somewhere. 02:10:08 I know that feeling. 02:10:34 The feeling of not knowing what for proofs of memory to be science somewhere. 02:10:48 Sometimes I feel like really I still don't know what for proofs of memory to be science somewhere. 02:17:07 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 02:17:14 Also: 02:17:25 23:47:44: You have to totally it. 02:18:04 -!- |f`-`|f has quit (Ping timeout: 250 seconds). 02:18:24 11:56:54: hmm, not the falling 02:18:59 -!- |f`-`|f has joined. 02:19:43 Oh my god. Deepest words ever produced by a neural net. 02:20:03 11:14:36: int-e: I'm not fungot, and I'm completely fungot. 02:20:03 tswett: any ideas? comments? concerns? please contact the webmaster/ fnord/ 04/ fnord/ fnord/ images/ p6_cover_big.gif 02:22:37 -!- hppavilion[1] has joined. 02:23:44 -!- Patashu has quit (Ping timeout: 244 seconds). 02:24:29 -!- Patashu has joined. 02:28:20 there is a unicode character for "may peace be upon him" ﷺ 02:28:38 fungot: give me a sentence please. 02:28:38 tswett: scheme in lisp, with optimizations. there was hugs, too, for all practical purposes 02:28:41 `unidecode ﷺ 02:28:42 ​[U+FDFA ARABIC LIGATURE SALLALLAHOU ALAYHE WASALLAM] 02:35:05 -!- atslash has quit (Quit: This computer has gone to sleep). 02:35:14 i wonder what unicode character is the most complex 02:37:35 > 0xfdfa 02:37:37 65018 02:41:09 `unidecode 𪚥 02:41:09 ​[U+2A6A5 CJK UNIFIED IDEOGRAPH-2A6A5] 02:42:18 that's a chinese character with 64 strokes, consisting of 4 of 龍 in a square 02:44:07 apparently it means "verbose." ha. ha. ha. 02:46:58 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:52:03 What does 龍 mean? 02:52:55 Dragon 02:53:40 in Mandarin, pronounced "long" in Japanese pronounced "ryuu" 02:54:40 -!- rdococ has joined. 02:55:24 Although in japan the simplified form 竜 is more common than 龍 03:05:38 -!- JesseH has joined. 03:06:19 Writing an interpreter for my language to learn another language and I need to make some decisions to make derplang better. 03:07:11 As of now, i allow users to use multiple lines, although originally you could only use one line. Wouldn't it make sense to go back to only allowing one line? 03:07:46 One of of code for the whole program you mean? 03:08:39 if there is no length limit on that line then there's no problem 03:10:23 but then all that's really doing is forcing the user to do one more step, if it comes to it, which would be taking out the useless whitespace which my interpreter would normally do. 03:11:11 However, since this is an esolang, shouldn't that make sense? 03:11:21 I don't know othey things about derplang, so I've no idea of the context in which it originally only allowed one line. 03:13:36 Simple, the language forced the use of one line at first, and then i made the interpreter not care. 03:14:02 Also, I need a mod on the wiki to help me out. I tried to edit my page and it said that it was harmful. 03:14:17 if an interpreter reads one byte of source at a time, and doesn't handle whitespace as a noop... 03:14:30 then it would only allow one line 03:14:45 I see no commands for importing libraries. 03:14:57 -!- MDream has changed nick to MDude. 03:15:20 I'm trying to get rid of some unimplemented filth on the wiki 03:15:29 I wrote some stuff such as STD which isnt a standard library at all 03:15:44 such as the STD section* 03:16:10 If each program was one line, but could be called as a function by just saying something like function:filename, that could keep things short. 03:16:20 While making a ton of library layers. 03:16:50 The point was to not care about the length of the code, and just allow one line only, anyway. To make it painful. 03:16:59 -!- JenTheHappyGeek has joined. 03:17:07 Since I didn't feel the language was esoteric enough. 03:17:49 Hi there! I stumbled across this channel and was wondering what its purpose/subject-matter is. 03:17:59 ah, i see 03:18:03 -!- JenTheHappyGeek has left. 03:18:24 :| 03:19:24 lolwut 03:20:12 tralala? 03:20:24 Can a mod on the wiki change /derplang (the page) to http://hastebin.com/marogejivi.vhdl 03:20:30 Apparently I can't. 03:23:23 Oh wow, I have a lot to fix on that page. 03:23:30 It's like I wasn't even trying to create a good page. 03:24:27 [wiki] [[Derplang]] http://esolangs.org/w/index.php?diff=43960&oldid=38893 * Orenwatson * (-91) changed from pastebin supplied via irc 03:24:38 there you go 03:25:10 [wiki] [[Derplang]] http://esolangs.org/w/index.php?diff=43961&oldid=43960 * Orenwatson * (+0) fixed typoes 03:25:42 Thanks, oren 03:25:55 Being able to make changes myself would be even better! :P 03:26:04 try now 03:26:37 I think the prblem was caused by content that was already there being considered "harmful" 03:27:01 that is, the rules for what is harmful changed after the page was created 03:27:05 or something 03:28:24 by the way im not a mod 03:29:13 [wiki] [[Derplang]] http://esolangs.org/w/index.php?diff=43962&oldid=43961 * JesseH * (-108) 03:29:25 Okay sweet. I edited it successfully! 03:30:27 Either way, oren. I made the changes I wanted to make, and i blame you. 03:31:03 [wiki] [[Derplang]] http://esolangs.org/w/index.php?diff=43963&oldid=43962 * JesseH * (-1) 03:31:14 Every update I make will get spammed into here? :P 03:32:17 yup! it never became a problem since the wiki is not so active 03:32:19 I think I'm going to take out the fo command. 03:32:31 (for loop) 03:32:47 Then people will be forced to do everything with eq and go 03:32:57 and gt, and lt 03:34:57 [wiki] [[Derplang]] http://esolangs.org/w/index.php?diff=43964&oldid=43963 * JesseH * (-119) /* Language Overview */ 03:35:16 Took it out. I'm just cleaning this up before I implement in erlang. :P 03:37:05 [wiki] [[Special:Log/newusers]] create * D2alphame * New user account 03:39:25 -!- lleu has quit (Read error: Connection reset by peer). 03:39:47 -!- lleu has joined. 03:39:47 -!- lleu has quit (Changing host). 03:39:47 -!- lleu has joined. 03:55:12 -!- hppavilion[1] has quit (Ping timeout: 244 seconds). 03:59:42 JesseH: i believe you hit an anti-spam forbidding

03:59:48 *anti-spam rule 04:00:06 Oh, that makes sense. 04:00:29 -!- MDude has changed nick to MDream. 04:01:08 ais523 has made a number of rules based on spams not looking like normal wiki pages 04:01:30 ugh 04:01:43 can someone call the headache.Stop method please? 04:02:10 headache.Stop()[]; 04:02:48 -!- hppavilion[1] has joined. 04:05:23 umm 04:05:41 can't index nil 04:05:48 but thanks 04:06:25 In Argk, my new language, you can pass logic and what not to functions with [] 04:06:52 So like, "print('~n')[n=99, n>0, n-=1]; 04:07:01 would print 99, 98, ..., 1 04:15:40 you mean shorthand for for loops? 04:16:21 I so need to make a new programming language... 04:20:43 I would try to give more examples, but you're very annoying. 04:21:08 No offense, but it's not working for me tonight. I'd normally have no issue. 04:21:43 O_o 04:22:44 I give one minor example of something, and he corrects me, as if I didn't know my own language, and says that it is a for loop. :P 04:23:01 Yes, I gave you the example that replaces the for loop. 04:23:22 i think you're overinterpreting hth 04:23:35 I am, I am. 04:23:57 Guess I'm a little stressed and tired. 04:24:02 Sorry rdococ :P 04:26:14 print('hello', '~n')[x=input(), n=x+'!']; 04:26:55 That would first get input from you, and then print out "hello!" 04:27:27 But I feel like theres something im not seeing with this sort of idea that's broken 04:27:55 well it resembles list or monad comprehensions 04:28:05 but it's a bit inside out 04:28:29 It almost seems like a disorganized waste of space. 04:28:57 It's pretty much just putting code I'd write somewhere else inside []'s after a function 04:29:18 Well thanks guys, that ruined that idea. xd 04:29:27 [putStrLn("hello "++n)|x <- getLine, let n = s ++ "!"] would be legal haskell monad comprehension with the right extension enabled 04:30:08 and scala uses for syntax for the same thing 04:30:22 So I was about to make up monad comprehensions. Sweet, ill learn haskell or something one day. 04:31:05 I'm tired too. 04:31:22 but there's something else too, iirc Icon (which i don't really know) has expression which backtrack 04:31:27 *expressions 04:32:20 But how could you tell between the for syntax, and between indexing the value of a function? 04:33:03 E.g. if f(x) returned an array, what would f(x)[] do? Index f(x) at nil, return an error, or do some kind of iteration? 04:33:17 well that's the point where i thought icon's backtracking expressions might be closer 04:33:41 but none of these fits exactly, i guess 04:35:17 and you could maybe add prolog to the mix 04:35:44 well, you already know erlang 04:36:11 so it has some common elements. but i don't think it has that one. 04:37:12 JesseH: the tricky decision is exactly what decides when the iteration happens. 04:38:09 needs some evaluation and scoping rules etc. 04:39:11 and does print's implementation need to handle any of it 04:39:20 I can see f(x)[...] could return multiple things. 'a,b,c = f(x)[...]' for example. 04:39:40 oerjan, The idea is to implement useful things for functions, that might be commonly written. 04:40:45 sure 04:43:44 oh and APL/J/K has a lot of this for arrays, but in that case it's _definitely_ each function needing to handle it 04:45:02 JesseH: what i mean is, among other things, does a function get to decide whether to pass the whole [...] thing along to another function instead 04:45:18 and is the default to do that or the opposite 04:45:25 Hellu 04:45:30 Anyone present? 04:45:39 nope, completely empty hth 04:45:47 Ah 04:45:48 OK 04:45:55 O_o 04:46:10 oerjan, you decide, and ill get back to you on that once i sleep :| 04:46:19 ARGH 04:46:54 I'm designing a simulator which emulates an Esoteric Processor 04:47:04 OR a simulator which emulates an Esoteric Universe 04:47:11 Anyoone have any ideas for either one? 04:47:18 what about an Esoteric Professor twh 04:47:36 * oerjan full of bad ideas today 04:48:26 The Esoteric Processor I'm going to have to think about what I want it to be like in general, now that I think about it 04:49:50 "EsoUni-I: A Foreign Universe" 04:49:52 esoteric 04:50:01 what about an esoteric esoteric thing? 04:50:06 Oh 04:50:08 Hi, rdococ! 04:51:19 I want the Esoteric Processor to be: 04:51:31 GUI-based (that is, you'll have a GUI that you work with) 04:51:35 Configurable 04:52:06 Buildable (as in, you assemble an EsoProcessor in the emulator, it doesn't just spit one out) 04:52:20 -!- JesseH has quit (Remote host closed the connection). 04:52:43 Esoteric, but not so much that it alienates people 04:53:10 -!- bb010g has quit (Quit: Connection closed for inactivity). 04:54:50 an esoteric processor? 04:55:08 what kind of processor? 04:55:23 I'm not sure yet 04:55:26 As in, a computer 04:55:46 I want to make an almost-game where you build a computer that behaves very differently from any real computer 04:55:59 As far as I know, most processors are esoteric, at least to me... 04:56:09 how do you do that? computers can behave like anything, that's what they're meant to do 04:56:10 zgrep: Fair point 04:56:20 rdococ: Another fair point 04:56:26 But these would look weird :P 04:56:42 you want a computer that looks and behaves weirdly? 04:56:44 Basically, it wouldn't be /too/ esoteric, as really esoteric things alienate people 04:56:58 rdococ: Yes. And I want to make an almost-game out of it 04:57:06 and what is an almost-game? 04:57:29 An almost game is something with gameplay components but no real game 04:57:36 Like Minecraft in creative mode 04:57:54 Except you can just think and stuff happens 04:58:04 umm, that's called mind reading 04:58:18 it could certainly be possible, but not accurate 04:58:41 That's not part of the game 04:58:50 uh... 04:58:57 An almost game is something that /could/ be a game if one were to add an actual challenge ot it 04:58:58 okay, back to talking about an almost-game 04:59:01 That's what i meant to say 04:59:11 you mean sandbox game? 04:59:23 they're not almost-games, they're games 04:59:25 Kind of 04:59:36 but not even a sandbox? 04:59:38 Sandbox games are PvLoS 04:59:46 Player versus Lack of Stuff 04:59:57 OK 05:00:09 Imagine a game where the goal is to build computers for aliens 05:00:11 what an interesting way to look at a sandbox game 05:00:15 You have a conveyor belt 05:00:19 You assemble a computer 05:00:21 Then you test it 05:00:44 and it causes BSOLOD: blue screen of lack of death 05:00:45 jk 05:00:54 Now remove any cost constraints and the requirement to build a computer for aliens, but leave in the computer building part 05:01:00 THAT'S what I want to make 05:01:03 I'm tired, so I might act a bit jerky, like a machine that needs lubricant 05:01:26 oh 05:01:27 Ah 05:01:41 you mean, a program in which you can assemble your own computer? 05:01:47 Yes 05:01:55 But it's a simple computer 05:02:02 how simple are we talking? 05:02:05 And defies all notion of what a computer is to a primative mortal 05:02:11 Simple enough for me to program xD 05:02:15 hmm 05:02:35 as I said earlier, a computer is meant to be programmable to behave like any machine, as it's a general purpose machine 05:02:51 True 05:02:53 so this defiant computer would be meant to be not programmable, and can't behave like any machine 05:02:56 But its base nature stays the same 05:03:00 No 05:03:00 oh 05:03:10 I said "To a primative mortal" 05:03:15 a primitive mortal? 05:03:25 Someone who doesn't understand what you just said 05:03:29 About programmability 05:03:42 okay 05:04:01 a primitive mortal would think a computer...uhh...would they even think about it? 05:04:01 An esoteric computer would, for example, run a declarative machine code based on geometry 05:04:07 oh 05:04:16 And formal logic 05:04:29 so something that consumers don't think of as programming? 05:04:39 Exactly 05:04:45 haskell? 05:05:05 well, I wouldn't exactly call haskell programming, but it fits what you say 05:05:06 Yes 05:05:20 But you would have a flashy interface where you build a computer like that 05:05:31 It's more quasi-esoteric than esoteric 05:05:33 a computer that runs declarative machine code... 05:05:38 I need something that seems esoteric 05:05:43 But isn't _that_ esoteric 05:05:49 Such as not to alienate consumeres xD 05:05:58 I'm being very shallow right now 05:06:03 we'd need something a little less esoteric than haskell, right? 05:06:13 Yes 05:06:19 hmm 05:06:31 Another example is that, in this program, you could construct a ternary processor chip 05:06:33 wait, we want consumers to be able to program in it? 05:06:48 Advanced consumers 05:06:58 like small businesses? 05:07:10 Like the kind of people who build Minecraft computers 05:07:22 computers in Minecraft? 05:07:25 Yes 05:07:27 People do that 05:07:33 oh 05:07:38 hmm 05:07:49 I'm going to write down the Ternary chip idea 05:07:49 you can do this in logisim, I think 05:08:43 which is a program that simulates circuitry 05:09:14 I'll check it out 05:09:17 okay 05:09:57 So 05:10:08 It'll allow you to construct esoteric processor chips 05:10:14 Which will be converted to Lua 05:10:18 Or something 05:10:26 And build computers with those chips 05:10:28 it sounds doable 05:10:53 might have already been done 05:11:05 people have assembled whole computers in Logisim 05:11:37 True 05:11:45 This would make it more fun though 05:11:59 'Cause you get a pretty 2D interface 05:12:00 xD 05:12:29 Another, non-esoteric project I'm working on is an Evolution simulator 05:13:13 can't we just make a general purpose processor that can act like every other processor? 05:15:12 ...okay... 05:15:19 That's the computer that the device is running on 05:15:32 And, if you do it right, the computer that you build 05:15:36 I have an idea for a new programming language which I had a long time ago, but never got around to making an article for 05:15:58 stupid cd drive making clicky sounds 05:16:06 in which programs are stored as mathematical functions 05:16:32 Ooooh 05:16:54 program(state, input) => new state 05:16:59 OK 05:17:16 but unlike a FSM, there are infinitely many possible states 05:17:33 how about (state, input) => (state, Maybe output) 05:17:55 yes, we need an output system 05:18:33 but what to output for each state? 05:18:39 there are infinitely many states 05:19:14 also, such output system is not required for turing completeness 05:19:27 But it's required for anyone-caresness 05:19:42 A language should always have IO for anyone to care 05:19:48 and it's required for less-esotericness 05:20:00 although there's already "output": the state number 05:20:02 IO doesn't make a language any less esoteric 05:20:13 I have thought of similar things too though about such program mathematical function 05:20:23 Preferably an esolang should also have GUI support 05:20:32 I want to see BeKinter 05:20:48 people care about brainfuck, and brainfuck has no GUI 05:21:02 I know 05:21:15 But people would LOVE an esolang with GUI that maintains esotericness 05:21:26 I mean, people love BF 05:21:28 why not two special infinite subspaces of the state space, where states in the first ouput 0 and the other outputs 1 05:21:41 I basically mean that GUI gets you points 05:21:47 and states outside both don't output 05:23:14 my Folder programming language, despite not being TC, does have GUI, but it's not mentioned nearly as much here 05:23:20 Hi oren 05:23:31 Folder has full GUI 05:23:38 It has every possible GUI imaginable 05:23:59 and it's still esoteric, to an extent 05:24:09 I firmly maintain my stance that programs embedded in Folder make it TC 05:24:31 Also, wouldn't it be cool if someone were to make a TC filesys? 05:24:38 That would be AWESOME 05:24:40 and I firmly enforce my rule that such programs embedded in Folder programs stop them from being Folder programs 05:24:49 :,( 05:24:53 WAIT! 05:24:58 I know how it can be TC 05:25:00 only linear media are allowed in folder programs 05:25:06 yeah? 05:25:11 Have a text file giving a user instructions on how to manipulate the folders 05:25:19 that's cheating 05:25:21 The brain is TC 05:25:28 if that was true, then Text would be TC 05:25:35 Text IS TC 05:25:39 ... 05:25:41 Text is (usually) english 05:25:50 Text is NOT TC 05:25:53 (when the writer is an english speaker) 05:26:01 the human brain isn't TC as you claimed 05:26:18 Wait, is text an esolang or are we just discussing plaintext? 05:26:26 the esolang 05:26:26 How is the brain not TC? 05:26:28 Oh 05:26:34 yaeh. all real computers of any kind are subTC 05:26:39 I thought we were discussing text/plain 05:26:42 Oh 05:26:44 Well duh 05:26:45 the brain is in the real world, and nothing is TC in the real world 05:26:48 Limited memory 05:26:52 exactly 05:26:53 It's Practical TC 05:27:00 .. 05:27:07 Practical TC is what we have 05:27:27 we can do stuff TC can't, for example, solve the halting problem 05:27:27 What if there's a SuperTC computational class that the human brain is orders of magnitude too tiny to comprehend? 05:27:32 so if brains are so good go marry one 05:27:50 rdococ: We can solve halting problems that can be solved 05:27:58 But we can't solve THE halting problem 05:28:21 hppavilion[1]: actually, we can solve THE halting problem 05:28:22 We can only solve whether SOME programs will halt 05:28:26 Oh 05:28:28 Right 05:28:29 xD 05:28:51 if a program halts if it doesn't halt, we can see that the program halts if it doesn't halt, and say that is the solution 05:29:01 Yes 05:29:13 But the programs we do that on can be solved by computers too 05:29:20 oh... 05:29:29 THE halting problem is whether it's possible to solve if ANY GIVEN program will halt 05:29:44 give me any program you think can't be solved, and I can solve it 05:30:17 5/0 05:30:24 that halts. 05:30:42 usually, it halts with an error or a crash. 05:31:03 next 05:31:09 I think the solution to the Halting Problem was to plug the Halting Problem into a Halting Problem Solving machine, and for some reason that wouldn't halt 05:31:26 Isn't a Probablistic Turing Machine super-TC? 05:31:39 Since it can solve the problem of "Generate a completely random number"? 05:31:58 the halting problem is to write a program that tells whether a program given an input will halt 05:32:11 Oh rihgt 05:32:14 *right 05:33:54 rdococ, write a program that tells whether a program given an input will halt 05:33:54 my brain can do that 05:34:04 That was fast 05:34:21 technically my brain has a program that can do that 05:34:25 To those reading the logs, check the timestamps between those last two messages 05:34:26 tada, solved halting problem 05:34:44 Not for any given program though 05:34:51 give me a program 05:34:51 Only for programs up to a certain complexity 05:34:53 That cannot be solve in the general case even by your mind, as far as I know 05:35:09 The Halting Problem's Solution is your problem 05:35:17 okay, imagine a hypothetical version of my brain that has infinite memory 05:35:31 that would be TC, and could solve the halting problem for programs of any complexity. 05:35:59 it's not impossible to solve the halting problem, just more complicated than running the program 05:36:13 Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. A key part of the proof was a mathematical definition of a computer and program, which became known as a Turing machine; the halting problem is undecidable over Turing machines. It is one of the first examples of a decision problem. 05:36:16 -Wikipedia 05:36:23 Can't argue with Turing 05:36:26 -!- Sgeo has joined. 05:36:37 Hi Sgeo! 05:36:44 We're arguing about the Halting Problem! 05:37:01 I once argued with my teacher about the halting problem 05:37:21 rdococ thinks he can decide whether ANY given program with a given input will halt 05:37:28 Who won that argument? 05:37:37 He seemed to think it applied to finite memory .. actually, does it, the way it's defined? Since you need a machine with more memory than the one executing the program in question 05:37:52 I did, once he googled it and saw that it's about infinite memory 05:37:58 Yeah 05:38:15 I never said it applied to finite memory 05:39:03 and I know full well it doesn't 05:39:36 Sgeo: It doesn't, as the program in question could need an indefinite amount of memory, and thus the Solver's must be infinite 05:40:02 I used wikipedia talking about Turing. I think I won. 05:40:11 xD 05:41:36 Ooh 05:41:39 Andrey Kolmogorov 05:41:43 Won a Stalin Prize 05:41:49 That is/was a thing apparently 05:45:05 that what? 05:45:54 [wiki] [[Algebra]] N http://esolangs.org/w/index.php?oldid=43965 * Rdococ * (+306) wow, this article is really short, need to add examples one day 05:46:46 [wiki] [[User:Rdococ]] M http://esolangs.org/w/index.php?diff=43966&oldid=43208 * Rdococ * (+18) added algebra 05:47:58 [wiki] [[Folder]] http://esolangs.org/w/index.php?diff=43967&oldid=43884 * Rdococ * (+126) /* Computational Class */ you need to read this hppa 05:50:51 Sgeo: if you apply the method of the proof for the halting problem to the case of finite memory, you end up with the space hierarchy theorem instead hth 05:52:01 which is how we know e.g. LOGSPACE != PSPACE != EXPSPACE 05:54:54 all the programming languages I "make" are always about FSMs... 05:55:04 I'm going to try to make one that's NOT about FSMs 05:55:28 something illogical 05:55:34 idk... 05:55:38 `? fsm 05:55:39 fsm? ¯\(°​_o)/¯ 05:55:53 finite state machine 05:56:01 `learn An FSM is a state machine with noodly appendages. 05:56:01 `? fsa 05:56:03 fsa? ¯\(°​_o)/¯ 05:56:05 Learned 'fsm': An FSM is a state machine with noodly appendages. 05:56:18 oh! good idea 05:56:27 rdococ: What's a Lock Automaton again? 05:56:30 -!- zadock has joined. 05:56:31 I will make a programming language to glorify the flying spaghetti monster 05:56:33 I'm not good with my automata 05:56:44 uh...a lock automaton? 05:57:00 rdococ: that language must only support GOTO as control flow, such as to encourage Spaghetti code 05:57:02 I forgot... haven't been into programming languages for a while now 05:57:05 It's mentioned on the folder page 05:57:34 -!- zadock has quit (Remote host closed the connection). 05:57:37 that was just a tree view of an example of an FSM 05:57:55 [wiki] [[Folder]] M http://esolangs.org/w/index.php?diff=43968&oldid=43967 * Rdococ * (-10) /* Examples */ idk what "Lock Automaton" is, so 05:58:10 it's just a lock programmed into Folder as an FSM 05:58:14 a* 05:58:36 rdococ: We need to define a TC derivative of folder xD 05:58:54 And then force Bill Gates to implement it into Windows at Gunpoint 05:59:21 Hahahahahahaha no seriously.. 05:59:26 s/.././ 05:59:32 ... 06:00:03 great idea, except for forcing Bill Gates to implement it 06:00:12 I know 06:00:15 I was kidding 06:00:16 even though Folder itself is already implemented in Windows 06:00:25 I know 06:00:29 A TC derivative of it 06:00:37 That's what I was going for 06:00:55 Or an enhanced derivative of it at least 06:02:02 idk if that's possible 06:02:18 maybe we could define a new type of folder with infinite subfolders? 06:02:25 Sure 06:02:42 but how? 06:02:59 Via the magic of code 06:03:15 yeah, and then it wouldn't be already implemented 06:03:24 as folder is 06:03:32 Speaking of filesystems 06:03:44 I have a strong interest in the EsOS 06:03:53 Particularly its potential Filesys 06:04:02 THE esoteric OS, or just in general? 06:04:06 Do you have any ideas for stuff we could put in its filesys 06:04:11 Pretty much both 06:04:34 files with a negative number of data? 06:04:40 Ooooh 06:04:43 Interesting 06:04:52 idk how it would work 06:05:13 Better yet, files with complex numbers for data 06:05:15 Oooh 06:05:21 well, let's say we have a group of three files, ooooo|ooooo|ooooo 06:05:21 That could be something in the Esoteric Processor 06:05:31 Esoteric Logic Gates 06:05:31 for zero bytes, that'd be ooooo||ooooo 06:05:51 Wait 06:05:52 and minus one, that'd beumm... 06:05:58 I mean Complex Logic Gates 06:06:01 complex numbers? 06:06:11 Yep 06:06:15 do you mean complex amount of data, or do you mean complex bytes? 06:06:15 Complex Numbers 06:06:41 Complex number for quantity of data and, for the esoteric processor, complex bits fed into the logic gate 06:06:52 umm 06:07:01 how exactly would a file with 2i bits of data look like 06:07:26 or act like 06:07:58 Well 06:08:01 my mind is confused 06:08:22 I have no clue 06:08:25 my mind understands -30% of what we are talking about right now 06:08:35 Probably it'd be derived from Boolean Algebra 06:08:41 boolean algebra? 06:08:51 * hppavilion[1] googles "Complex Boolean Algebra" 06:08:57 true, false, imaginary truth, imaginary falsth 06:08:59 Boolean Algebra is the Algebra of Booleans 06:09:09 I know 06:09:18 Those are just the zeroes 06:09:22 wait 06:09:24 hang on 06:10:55 if we use 0 and 1 for false and true, the multiplication is AND, the addition minus the multiplication is OR, stuff like that, then if we used 1i for imaginary 06:11:05 1i AND 1 would be 1i for example 06:11:13 but 1i AND 1i would be -1... 06:11:22 confusion 06:11:45 seriously 06:12:09 can we please stick to negative files 06:12:46 -1 underflows to 1 06:12:53 Wait 06:13:00 What's -1%2? 06:13:04 %? 06:13:09 Or can you not modulus a negative number? 06:13:14 hang on 06:13:17 well 06:13:39 To wolfam|alpha! 06:13:42 0%2 is 0, 1%2 is 1, 2%2 is 0, going the other way, -1%2 is 1 06:13:47 1 06:13:55 I looked it up 06:13:59 So yeah 06:14:04 oh right 06:14:05 Complex boolean algebra 06:14:07 1i AND 1i would be 1 06:14:08 It's a thing now 06:14:22 what's 1 OR 1i? 06:14:58 If we know that, we can distribute out complex booleans 06:15:07 1i OR 1i, which is i + i - 1, would be 2i-1, if we do the modulus separately, that's 1 06:15:21 OK then 06:15:27 Imma make a doc 06:15:50 1 OR 1i is 1 + i - i, which is just 1 06:16:33 would 1i OR 1i be i + i + 1 as before we do the modulus, or woud it be i + i - 1 06:17:35 I think modulus is always done last 06:18:10 I'm too confused 06:18:15 I am too 06:18:18 brb 06:18:42 The primatives of Boolan Algebra are AND, NOT , and OR, I believe 06:22:09 also, would 1+i exist? 06:22:28 complex numbers don't work well with modulus 06:23:35 -!- Patashu has quit (Ping timeout: 256 seconds). 06:25:00 -!- Patashu has joined. 06:27:32 rdococ: Yes, yes it would 06:28:02 rdococ: No, no they don't. 06:28:04 Apparently 06:29:22 Wait 06:29:25 Looks like they do 06:29:42 complex modulus is nothing like normal modulus 06:29:50 It appears you just (a+bi)%2 = (a%2)+(b%2)i 06:30:03 If wolfram|alpha is to be trusted 06:30:26 It appears what is called "modulus" in complex numbers refers to complex absolute value 06:31:17 Citation: https://www.wolframalpha.com/input/?i=1%2Bi%252 06:33:22 https://docs.google.com/document/d/1ucWQlrcBiFQHjmTS4TN5I5DpkJbI17PXctn3l2XrzbE/edit?usp=sharing 06:33:35 In case you want to help me document Complex Boolean Algebra 06:40:51 p or not p or ip 06:42:33 We only need those three lines I added, hppavilion[1] 06:42:36 rdococ: I'm thinking of implementing a library for this in python. However, I'm bad with complex numbers. So I need to figure out how to do it 06:42:48 rdococ: I know, but at this point I'm just being stubborn 06:43:37 Maybe we should publish a research paper on this xD 06:43:43 python already has complex numbers 06:43:46 I think I've just found my college thesis 06:43:58 newsham: I know. We're doing Complex Booleans 06:44:17 In... 12+ years xD 06:44:18 complex(1,5)%2 == complex(1,5) in python, it seems 06:44:36 That's probably a problem 06:44:49 this complex boolean stuff is getting boring 06:45:16 it doesn't suddenly magically make super magical core functionality appear in an OS 06:45:35 which esolang does that, rdococ? 06:45:55 we're not talking about esplangs 06:46:04 I was taling about that complex boolean thing 06:46:14 complex booleans dont count as esoteric then nothing does 06:46:28 never said they weren't esoteric 06:46:32 i think you've reinvented gaussian integers (mod 2) 06:46:33 I said they weren't eso langs 06:46:57 oerjan: Did we? 06:47:53 a perfectly respectable ring with four elements 06:48:23 it's not a "boolean" ring though. x^2 = x doesn't hold. 06:48:27 rdococ: It may not introduce core functionality to an OS, but it certainly would make a cool thing to deal with when designing an Alien Processor 06:48:32 (as you've already found out.) 06:48:47 oerjan: Wait, what? 06:49:53 http://math.stackexchange.com/questions/274694/modulo-complex-number 06:50:30 wait 06:50:33 1i^2 = -1 06:50:40 so... 06:50:58 I don't like complex booleans anymore, I'm done with them 06:51:18 they make no sense, not even esoteric sense 06:51:20 Ok 06:51:38 What other esoteric abstract concepts are there...? 06:51:42 what about a file of negative size? 06:51:46 sqrt(-1) = +/- i 06:51:52 That's easy to solve 06:52:16 The negative file size means it removes data from the previous file 06:52:19 a file of negative size overwrites previous data with empty data 06:52:25 Yes 06:52:40 so creating a negative file is the same as getting rid of data 06:52:45 Of course, I'm dealing at the phyisical, chip level 06:52:47 cat file negfile 06:53:01 Hm... 06:53:05 that could be AWESOME if used correctly 06:53:07 How about Computer Doritos? 06:53:18 garbage collection 06:53:20 len(cat a b) = len(cat a) + len(cat b) 06:53:33 you would be able to do garbage collection with negative files 06:53:37 wait 06:53:47 I took that term out of context 06:53:49 but 06:53:53 ugh 06:53:57 forget what I just said 06:54:02 so 06:54:03 hmm 06:54:05 You thought it was copy file but it turned out to be concat? 06:54:10 Files of complex size? 06:54:11 if len(cat b) < 0 then len(cat a b) < len(cat a) 06:54:11 how would a file of negative size be useful 06:54:19 I really like complex numbers today for some reason 06:54:24 It must be a saturday 06:54:24 oerjan: what's a ring that is not respectable twh 06:54:33 rdococ: dunno.. lets figure out what it means first, then figure out how its useful :) 06:54:36 #RespectALLRings 06:55:01 shachaf: one which hogs all its operators instead of distributing hth 06:55:04 what about a file whose size is unknown until you feed a value x? 06:55:15 for example, a file could have a filesize of x^2 bits 06:55:21 oerjan: that would hardly be a ring would it 06:55:36 does a file of negative length have contents? ie. does it need to have the same contents as another file to meaningfuly concat them together? 06:55:38 OERJAN, A *TOOL* OF THE CORPORATE MISOGYNY, SAYS NOT ALL RINGS DESERVE THE SAME RESPECT! 06:55:49 MATHIARCHY, ETC 06:55:52 newsham: interesting first answer, that means you can get the ordinary booleans by doing (mod 1 + i) 06:55:54 do i need to start with an "un-a" to cat it with a file that ends with an "a"? 06:56:15 newsham: I guess so 06:56:24 newsham: If you made files be free groups instead of free monoids, you could make something like that made sense. 06:56:30 concat("a", anti-"a") = "" 06:56:49 concat("a", anti-"b", "b") = "a" 06:57:05 concat("abc", anti-c) = "ab"; but concat("abc", anti-x) == ? 06:57:11 We have Boolean Algebra 06:57:19 But not Boolean Geometry or Boolean Calculus 06:57:21 but concat(anti-"b", "a", "b") is itself basically 06:57:38 what the bool would boolean geometry and boolean calculus look like? 06:57:49 i think "free group" is the right answer hth 06:58:10 But I'm not sure I've heard of people talking about the "length" of a free group element. 06:58:17 Well 06:58:28 http://math.stackexchange.com/questions/1147702/length-of-an-element-in-a-free-group 06:58:29 I'm yet to take calculus, so I don't understand it 06:58:42 I'll get back to you in a bit on Boolean Geometry 06:59:02 we'll need to know what a boolean function is to understand this boolean calculus 06:59:21 but I'm just going to go with my anti-file idea because I smell potential 06:59:22 so creating a negative file is the same as getting rid of data <-- this reminds me of that attempt someone made to make a reversible computation system in which types were a ring (it didn't look to me like it worked out, alas, although maybe with _just_ addition it does) 06:59:53 Oh 07:00:08 It looks like Boolean Geometry is still yet to be a thing 07:00:11 Wait 07:00:15 How did I get that wrong 07:00:19 I meant it's already a thing 07:00:20 xD 07:00:30 "ba" - "b" =/= "a" 07:00:37 in the file system 07:00:43 it's like a stack thing 07:01:10 "abc" - "cb" = a? 07:01:16 guys, should concat("ba", anti-"b") be "a" or not? 07:01:34 newsham: I guess so? 07:01:42 So boolean geometry takes place in a space where the coordinates can only be 1s and 0s 07:01:47 Exactly as I had forseen 07:01:51 newsham: yes 07:01:53 Mwahahahahahahahahhaha 07:02:16 so you can only get squares, triangles, lines and points in boolean geometry? 07:02:17 hppavilion[1]: how about multi-dimensional boolean geometry 07:02:39 newsham: Well duh 07:02:58 I meant the numbers in the coordinates can only be 1s and 0s 07:03:00 this talk about geometry reminds me of an idea I had 07:03:11 so each coordinate is a bit vector 07:03:21 basically, I had the idea of making a minecraft like game that uses polygons instead of voxels 07:03:40 and dot products = parity(A xor B) ? 07:03:41 So in Boolean 2-space the coordinates can be (0,0), (0,1), (1,0), or (1,1) 07:03:42 Yes 07:03:44 Exactly 07:03:47 A bit vector 07:03:57 rdococ: Sort of like Gary's Mod? 07:04:00 I think? 07:04:03 so you could "dig" into polygons, which would actually be splitting the polygon into smaller ones, and making the polygons closer to the dig area farther away from the player 07:04:07 I don't know much about gary's mod xD 07:04:15 Ooooh 07:04:18 wait, not parity(A xor B), foldr OR False (A xor B) ? 07:04:34 Oooh 07:04:42 Why not make a Minecraft-based Programming Language 07:04:44 and if you dug to the surface on the other side, the points too far would be removed, and the points close to the surface would connect with the surface 07:04:54 Where you input a Minecraft World and it spits out something else 07:05:04 EsoGames 07:05:07 hppavilion[1]: interesting 07:05:10 We need to start developing those 07:05:15 rdococ: a boolean function is just a function that takes booleans and returns booleans. also see: post's lattice 07:05:15 how about a game where you solve proofs? 07:05:37 I don't like that in Math, you can't do things like line(a, b) where a and b are points 07:05:47 Non-anonymous data makes me sad :,( 07:05:50 https://www.cs.washington.edu/verigames 07:05:56 At least, as far as I've been taught that's how it works 07:05:59 yay for annonymous data 07:06:03 first class data 07:06:09 f + 2 07:06:10 #FirstClassData 07:06:21 I prefer zeroth-class data 07:06:28 uh what's that 07:06:59 separation of Church and state 07:07:09 I'm still working on that joke 07:07:13 the church of the FSM 07:07:17 Zeroth class data is... um... 07:07:22 What's second class data? 07:07:25 "abc" - "cb" = a? <-- eek that's not very groupy 07:07:31 get it? church of flying spaghetti monster, which also means finite state machine, church, state? get it? 07:07:33 Maybe we can extrapolate by correlation 07:07:55 i meant Alonzo Church 07:08:28 xD 07:08:52 second class data? 07:09:05 what about an OS where files didn't exist 07:09:37 rdococ: Yes. Second class data. 07:09:40 That's a thing, right? 07:09:59 second class data is data that's not treated first class 07:10:45 Oh 07:10:51 So what's zeroth-class then? 07:10:52 anyway, what about an OS without files? 07:11:03 zeroth class data is...umm...idk 07:11:04 Data that you can't assign a name maybe? 07:11:15 1st class data = in register, 2nd class = in cache, 3rd class = in memory, 4th class = in remote memory, 5th class = on interwebs 07:11:18 Makes sense 07:11:42 2nd class: Must be named 07:11:48 1st class: Need not be named 07:11:53 0th class: Cannot be named 07:12:02 https://en.wikipedia.org/wiki/First-class_citizen 07:12:19 sqrt(-1) class = ? 07:12:34 n mod (1+i)th class? 07:12:43 -1st class = Can have a name of negative length only 07:12:56 newsham: the name makes you go insane hth 07:13:36 so what if everything was a zeroth class object? 07:13:44 as in, a programming language where nothing has a name? 07:13:53 points free language? 07:13:59 like sk combinators? 07:14:19 but can't you just give the item a property called name? 07:14:45 oh wait you can't because then the property would be named name 07:14:57 I want to define an EsoLang based on Geometry 07:14:59 and you can't name it a number either 07:15:05 so no arrays for you 07:15:19 you can construct a tuple with a value item and a name item, without explicitely naming them 07:15:34 true 07:15:43 but how will you know which one is the name item? 07:16:02 is there a variable x with a value of 3, or a variable 3 with a value of x? 07:16:13 convention 07:16:33 it's not as easy as saying a random word 07:17:04 i should write a SKI VM with syscall support 07:17:43 -!- Patashu has quit (Ping timeout: 244 seconds). 07:18:56 -!- Patashu has joined. 07:27:32 -!- digitalcold has quit (Ping timeout: 244 seconds). 07:29:48 -!- digitalc1ld has joined. 07:30:38 -!- FireFly has quit (Ping timeout: 244 seconds). 07:35:42 -!- x10A94 has joined. 07:36:14 rdococ: Maybe you will know which one is the name item by the datatype. 07:36:35 forget about that zeroth class thing 07:37:20 does anyone have any ideas on how to use negative files to their full potential 07:37:28 either with or without content and order and stuff 07:38:06 I don't know 07:41:01 without content 07:41:03 hmm 07:45:46 Is there the minesweeper variant where the bombs can move by itself? 07:48:18 -!- FireFly has joined. 07:48:54 maybe if we find a different way to treat negative file sizes 07:49:28 maybe a file of negative size is a memory space extension 07:49:52 OK, try different kind of idea lets see what can be figured out. 07:49:53 so if you have five bytes of data left, a file of negative space would increase that 07:50:05 Try to figure out how it work and then you can see if it is work 07:50:35 forget the negative idea 07:51:01 do you know of a way to make an OS turing complete with only a file system at your disposal? 07:51:23 you'd have to make up programming language structures like Folder 07:51:37 I don't know 07:51:47 I may think of it in future but maybe not 07:52:06 Folder programs, at the very least, are folders made up of subfolders with shortcuts in them to other subfolders 07:52:18 I use the term shortcut very broadly here 07:52:52 Programming has Verbs (functions) and nouns (objects of various sorts) 07:53:02 But no adverbs or adjetive 07:53:03 s 07:53:10 Well 07:53:20 Try to make one with adverbs and adjective 07:53:22 Generally 07:53:35 (possibly even without so much (or any) verb/noun if can be made to do????) 07:53:50 adverbs would be functions that modify functions 07:53:56 Yes 07:53:58 Exactly 07:53:58 e.g. sitting is different from quickly sitting 07:54:29 adverbs are declarative functions acting on functions, and adjectives are declarative functions acting on nouns 07:54:33 quickly sit() would perhaps optimize the sit() method prior to calling it if the langauge is interpreted? 07:54:48 yeah 07:54:53 -!- AnotherTest has joined. 07:54:55 Then there are pronouns (variables) 07:55:02 quickly(sit)() 07:55:23 I prefer quickly sit() 07:55:47 Because I don't like things sharing syntaxes >.< 07:56:07 but quickly is a function itself, so it's the same thing 07:56:14 okay, quickly might have a return value, true 07:56:20 and it's declarative 07:56:57 I would prefer the "quickly(sit)()" if it is a function that call and can return other function, but if you are doing esoteric programming then it does not matter what way is better, just make it in whatever way you are to make it as 07:56:58 what about imperative functions acting on verbs? 07:57:05 hppavilion[1]: i hear the J language has adverbs hth 07:57:47 rdococ: but it isn't a function. It's an adverb. A metafunction of sorts. 07:57:52 quickly(sit)(rdococ) 07:58:06 metafunction function same thing 07:58:14 Nuuuuuuuuu 07:58:19 OK, well I suppose it can depend on how the function in programming language is work 07:58:20 hppavilion[1]: not in a first class environment 07:58:37 So it can depend if it is first-class function and stuff like that. 07:58:50 well could you quickly(quickly)(sit)()? 07:59:04 No 07:59:12 Because hopefully, quickly is already optimized 07:59:16 Probably a builtin 07:59:26 well, quickly(quickly) would optimize quickly 07:59:39 quickly(quickly)(sit)(rdococ) 07:59:42 quickly: sit() perhaps? 07:59:55 Next to adjectives 08:00:10 I wonder 08:00:20 there are verbs, adverbs and adjectives - are there jectives? 08:00:27 No 08:00:34 Jectives are nouns 08:00:36 -!- |f`-`|f has quit (Ping timeout: 244 seconds). 08:00:37 of course, adjectives are basically adnouns, 08:00:39 so 08:00:51 I'm just gonna call them adnouns from noun on 08:00:59 what about adadjectives? 08:01:03 they would describe adjectives. 08:01:04 Possibly 08:01:06 -!- |f`-`|f has joined. 08:01:12 Let's take a class Human 08:01:29 e.g. blue is an adjective, and dark in "dark blue" is an adadjective 08:01:44 Human describes things like name, age, occupation, sexual preference, place of living 08:01:55 but I'd rather focus on making an OS whose filesys is turing complete 08:02:09 What adjectives coiuld be applied to Human? 08:02:10 Nope 08:02:16 I adhd'd away from that by now 08:02:27 well I'm OCD'ing towards it 08:02:29 -!- TieSoul has joined. 08:02:36 I don't think it's possible 08:02:47 Well, not without an Esoteric Singularity 08:02:47 of course it is, go wild 08:02:54 what's an esoteric singularity? 08:03:26 Something so esoteric that thinking about it breaks your mind, making it impossible to think like a rational human being ever again 08:03:34 let's do it! 08:03:53 I already don't think like a primitive rational human being anyway 08:03:57 You can try, but I doubt you can succeed. 08:04:01 philCoulson = new Human(...) 08:04:13 What could we put in adjective? 08:04:15 (Whether or not you already think like a "primitive rational human being" anyway) 08:04:30 new fat human() 08:04:45 Let's focus on things that make actual programmatical sense 08:04:45 new fat young english human() 08:05:00 new slim young male english human() 08:05:01 new... actually, fat could be used to describe that it has extra data... 08:05:25 obese 08:05:31 No really 08:05:41 local orange = new annoying orange() 08:05:54 What descriptors could be applied to an object in general? 08:06:06 A single instance of a class 08:06:09 oh! we could do a programming language based on the annoying orange 08:06:39 to do 2+2: "Hey! Hey 2! Blender! Hey! Hey 2! Blender!" 08:06:53 -_- 08:06:57 and then "Hey! Hey 4! Packaging!" 08:06:59 You're an awful human being 08:07:05 I know 08:07:10 Seriously 08:07:19 what? 08:07:23 I'm ~bi-~curious now 08:07:41 (That was supposed to be struckthrough) 08:07:44 the Annoying Programming Language 08:08:10 What descriptors could be applied to single objects that would be useful? 08:09:09 Hey! Hey 2s! Blender! ~the 2's get blended into a 4~ Hey! Hey Blender! Hand! ~the hand empties the blender into the display~ 08:09:21 Hm... 08:09:34 new slim className(...) 08:09:39 That would take the class 08:09:47 Hey! Hey X and Y! Blender Z! adds x and y into z 08:10:03 But not include any variables not declared in the initialization? 08:10:03 No 08:10:06 That makes no sense 08:10:14 it blends X and Y into X+Y 08:10:41 and stores it in variable Z 08:10:53 We're having two completely different conversations 08:11:04 yeah... 08:11:15 I want an OS which can be turing complete with only a file system 08:11:21 I'm designing a new type of keyword that could CHANGE THE FACE OF OO PROGRAMMING 08:11:34 whatever 08:11:43 You're making a programming language based on a stupid web series turned TV show 08:11:55 A stupid webseries that I like, BTW 08:12:05 I didn't get ANY popularity for being serious with my Folder idea 08:12:25 and you get all your popularity for making slim objects?! 08:12:29 Hm... 08:12:36 Yes 08:12:48 With my new dieting program... 08:12:55 ... 08:13:03 you can eat annoying oranges! yay! 08:13:10 Yay! 08:13:14 Also 08:13:28 Please don't make the Annoying Orange programming language in that state 08:13:35 It's giving me LOLCODE flashbacks 08:13:42 Hey! Hey hppavilion[1]! 08:13:50 COUNTERKNIFE 08:14:42 Hey! Hey X! Knife! -- destroys X 08:14:53 I thought it would divide... 08:15:02 I had that idea too but naah 08:15:14 Hey! Hey X! Y KNIVES! 08:15:26 Next idea: Class expressions 08:15:31 divides X by 2 for now 08:15:57 meh, bored 08:16:18 foo = class(extends=[bar, baz], implements=[quz], abstract=True, interface=True){...} 08:16:33 That's not valid code, of course 08:16:40 foo = extends bar, baz, implements quz, abstract, interface class 08:16:46 I doubt you can have an interface that implements another interface 08:17:01 Though I don't know java 08:17:18 I like class expressions 08:17:26 Too bad no one uses them 08:17:55 I'm bored 08:18:01 Next idea? 08:18:02 have any ideas for a good idea I could use 08:18:25 Metaclasses? 08:18:31 have any ideas for a good idea I could take inspiration on for my own idea on how to get my own idea 08:18:33 naah 08:18:35 No... 08:18:41 rdococ: No, I think that is difficult 08:18:54 Star Wars programming language? 08:19:06 Programming language based on bad erotic fanfiction? 08:19:15 Just see what we have written and try to figure out. I don't know, so maybe it is or maybe it is not. 08:19:55 There is a list of ideas in the wiki, you can also add stuff like you have discuss here, onto there too, and can make an organization of replies and so on. 08:19:56 Now I want to see BEFF-Lang 08:20:22 There is not /one/ mention of Star Wars on the entire wiki 08:21:06 Then add into list of ideas and then there is one mention of Star Wars in wiki. Or, figure out how to make such esolang and make that page. 08:21:06 A programming language that, when read backwards, contains hidden, satan-worshipping messages? 08:22:23 natas liah 08:25:35 A language where EVERYTHING is a stack that you can revert to a previous state? 08:25:51 Yes that is some idea too 08:26:14 Please add anything not already in list of idea in wiki onto there (although you can discuss it on this IRC too please) 08:26:50 -!- FireFly has quit (Ping timeout: 240 seconds). 08:27:11 A language based on MS Office 08:27:19 Or a generic office suite 08:28:13 A language where things can only be accomplished with complex networking and threading 08:30:12 [wiki] [[Natas Liah]] N http://esolangs.org/w/index.php?oldid=43969 * Hppavilion1 * (+91) Created Page 08:32:20 [wiki] [[Natas Liah]] http://esolangs.org/w/index.php?diff=43970&oldid=43969 * Hppavilion1 * (+142) Stubbified, expanded page. 08:34:16 a programming language that looks like an office suite 08:34:25 Not that looks like an office suite 08:34:30 But that behaves like an office suite 08:34:34 yeah 08:34:41 but with turing complete files 08:34:56 something that looks at first to be an office suite, but you can make programs in it 08:35:01 For example, you can store data in various "programs" 08:35:04 a bit like excel 08:35:15 But to get data between programs, you have to use the "copy" and "paste" instructions 08:35:23 You can only do math in Excell 08:35:32 You can print stuff in Office 08:35:35 Wait 08:35:38 Not Office 08:35:39 Word 08:35:47 people have made fully functional games in excel 08:35:56 No 08:36:05 I mean excel is the only place where you can do math 08:36:38 Hello World would be something like: "open Word; type "Hello, World!"; print;" 08:36:50 naah 08:36:58 But it gets better 08:37:03 I'd rather have a programming language that looks like an office suite 08:37:50 basically spreadsheet or document format which supports programming features - not a programming language with random office suite words thrown in 08:37:50 -!- FireFly has joined. 08:38:04 basically, no lines of code 7 08:38:27 as my clumsy hands accidentally touch the 7 from the numpad 08:38:29 To do math, you have to do "Minimize word; open Excel; select ""; type ""; get ""; copy; minimize Excel; open Word; paste; print;" 08:38:43 You have different programs 08:38:53 And you transfer data between them via the Clipboard 08:39:11 open OpenOffice; do all your stuff instead of minimizing and opening Microsoft Offartice; close; 08:39:34 It would also include statements about the badness of MS Office 08:39:39 open ThisLanguageIsSpreadsheetFartNuts; close; 08:40:09 open Word; open ; print; 08:40:16 That's how you read a file and print its contents 08:40:23 So it's confusing, too 08:40:35 stop! stop rewording already existing programming languages! with you it's all do this, do that, do this, do that, some kind of glorified print, some kind of glorified read stream, some kind of this and that 08:40:43 it's driving me nuts 08:40:59 I'm not trying to just reword a programming language 08:41:06 I'm trying to come up with something original 08:41:10 But originality is hard 08:41:19 As it turns out 08:41:35 well try something other than reworded imperative lines of code then 08:41:58 I just thought it'd be funny to have a language where you open a bunch of different programs that don't intereact very well 08:42:24 my office suite idea was good enough, but you had to come and ruin it with imperative lines of code 08:42:33 You had your office idea 08:42:35 I have mine 08:42:40 I didn't ruin it 08:42:48 your idea isn't an office idea at all 08:42:51 I just came up with a different idea 08:42:59 it's a reworded Python 08:43:18 With a weird clipboard feature >.< 08:43:22 It wasn't the final language 08:43:27 I was going to make it weird 08:43:28 er 08:43:31 which is basically mov 08:43:39 or whatever 08:43:40 True 08:44:24 NEXT topic 08:44:28 Because ADHD is horrible 08:44:32 yay talk about my office idea now 08:44:46 say that to OCD 08:44:52 anyway 08:45:06 I have /pretty/ bad ADHD 08:45:15 And a bunch of other shit 08:45:21 But go on 08:45:25 you have shit? wtf? 08:45:30 Yes 08:45:37 I keep it in my sock drawer 08:45:44 keep it in the toilet 08:45:48 NEVAAAAAAAAAAAR 08:45:59 Go on 08:46:53 ok 08:46:55 well 08:47:08 you know how people have managed to make all sorts of cool games in Excel 08:47:16 I'll take your word for it 08:47:52 how about we make an office suite that is easier for them to make games in than Excel 08:48:07 Interesting 08:48:07 or basically extend the idea or something 08:48:26 or we could make the programming language look and act enough like an office suite people don't realize they're making programs 08:48:55 and when they realize, they'll realize that programming is easy and start programming 08:49:07 Yes 08:49:23 And we make it /just/ esoteric enough so that they join our little community, too 08:49:50 Because when I click "Random Page", I more often than not recognize the page I land on 08:50:06 yeah, we need more people in the esoteric community 08:50:39 knowing me, I'll get bored of it before I start making it, but it's worth a shot 08:51:11 although I have to go in an hour and thirty nine minutes 08:51:16 I've been planning to develop an Office Suite for a while 08:51:29 I could use this as practice, as it'll be a bit more simple 08:51:39 More like making a programming language xD 08:51:47 what should it look like? it could look like a spreadsheet program, or a word document program 08:51:51 And I won't need to make a spellchecker 08:52:08 I think it should be a few programs, such as to emphasize the office suitiness 08:52:49 I think that we should make it so that you can do cool stuff at the base, but oh, to do this you need to edit the .cfg which isn't too hard, oh you want to do that? You'll need to frobnicate the fnord... 08:52:58 That's how we entice them onto a technical level 08:54:24 Which is one of the most intimidating parts of programming 08:56:52 frobnicate? 08:56:53 fnord? 08:57:24 maybe there could be six levels of difficulty based on which program 08:57:30 word, spreadsheet, database... 09:00:12 or maybe just the same difficulty each 09:04:27 Word: You can hide chunks of text inside spoilers, simulating a decision tree. 09:08:57 Word: You can create buttons to go to different pages, simulating finite state automata. 09:09:04 Woohoo! 09:09:27 I just beat 2048 in one go! 09:09:49 Those are both good idea 09:09:50 s 09:09:54 Spreadsheet: You can type formulae into cells, simulating computation. 09:10:52 No, I think that's /actually/ computation :P 09:10:58 I've decided to keep the first idea for Word, and put my second Word idea into Presentation. 09:11:08 Good idea 09:11:15 Are you writing this stuff down somewhere? 09:11:28 No, I'm typing it. 09:11:55 Ah 09:12:01 Typing = writing in my world 09:12:07 Where are you recording this? 09:12:44 I'm not recording anything, I'm not a youtuber. 09:13:09 But you gave me an interesting idea. Let's include a movie maker in the office suite. 09:13:34 I mean where are you putting this information so you can later access it xD 09:13:49 I'm basically trying to figure out if you're putting it in Google Docs 09:13:50 Or not 09:13:56 not google docs 09:14:00 OK 09:14:04 I'm typing it down in Notepad 09:14:40 Ah 09:17:24 what about database? 09:17:35 -!- FireFly has quit (Ping timeout: 244 seconds). 09:17:57 IDK 09:18:04 That'd be the "Advanced Users" one clearly 09:18:16 so it should be more advanced 09:18:27 database already feels like a programming language 09:18:57 Database: You can create functions that conditionally modify database entries. 09:19:03 Yes 09:19:26 Should we allow the programs to be unified into a vast interconnected web? 09:19:45 what do you mean? 09:20:45 E.g. you can unify a BUNCH of different components into a single game 09:21:10 Like, a Database/Spreadsheet-based game 09:21:26 Or Database-backend-spreadsheet-frontend 09:21:34 Well 09:21:38 Spreadsheet-midend 09:21:54 Bundle: You can create buttons in the words of a document that trigger functions that conditionally modify database entries. You can create textboxes that display certain entries from the database. 09:22:26 actually, naah 09:24:11 Movie: You can create interfaces to go to different parts of the movie, like the menus in an actual movie. 09:25:36 which then we might as well change Presentation 09:26:16 so right now we have Word, Spreadsheet, Presentation, Database, and Movie 09:26:18 Interesting 09:26:24 What's Bundle? 09:26:31 Is that part of MS Word? 09:26:35 no 09:26:38 I mean office 09:26:42 What is it then? 09:26:46 Is it your own name? 09:26:50 Bundle would've been a name for a document with all five elements 09:27:01 Word, Spreadsheet, Presentation, Database and Movie 09:27:11 I'm thinking of changing Presentation 09:27:29 yeah, I'm removing Presentation 09:28:01 Ah 09:28:09 We can add presentation if we feel like it 09:28:14 movie can replace presentation 09:28:40 it'd be easier to do movie than presentation, atleast as how a presentation is usually thought of as 09:28:52 you don't want to click Presnetation, and suddenly see a movie maker window 09:29:43 now to make it look a bit more esoteric 09:30:03 have any ideas? 09:30:26 we could make the language used to create macros in Database more compact 09:30:50 by more compact I mean compact, I haven't even started making the suite 09:31:37 me or you or I (said it like that to satisfy grammar nazis) 09:33:33 What _language_ are we going to make this in? 09:33:49 It needs to be something with an R library most definitely 09:33:54 R library? 09:34:01 -!- atslash has joined. 09:34:08 R 09:34:12 It's a programming langauge 09:34:17 oh 09:34:17 It does graphing and stuff 09:34:23 It's very nice 09:34:35 It has a function to calculate P Value given a vector or something 09:34:42 but I want a good macro language 09:34:42 And Standard Deviation 09:35:03 We'd use a language which has a library FOR R 09:35:12 You can just make R Libraries, apparently 09:35:19 That's how code works as it turns out 09:35:36 I need to sleep 09:35:41 Guhni 09:35:42 if (some entry satisfies this condition and/or/xor that condition and stuff) then (modify this entry to some formula of the other entries something something) 09:36:03 but... 09:36:25 how about unconditional modification 09:36:33 but with the formula thing 09:36:53 imperative version of formulae in cells thing 09:38:07 -!- atslash has quit (Ping timeout: 246 seconds). 09:38:28 -!- atslash has joined. 09:39:49 -!- hppavilion[1] has quit (Ping timeout: 244 seconds). 09:48:52 -!- Phantom_Hoover has joined. 09:49:07 -!- sebbu has quit (Ping timeout: 252 seconds). 09:49:32 [wiki] [[Special:Log/newusers]] create * Ashl * New user account 09:49:48 -!- sebbu has joined. 09:50:34 -!- sebbu has quit (Changing host). 09:50:34 -!- sebbu has joined. 09:50:34 -!- AnotherTest has quit (Read error: Connection reset by peer). 09:50:40 [wiki] [[Swapper]] M http://esolangs.org/w/index.php?diff=43971&oldid=35536 * Ashl * (+24) 09:56:05 but what I really wanted was a programming GUI that looked like an office suite 09:56:09 so it feels professional 09:58:13 -!- AnotherTest has joined. 10:00:42 @tell boily http://csclub.uwaterloo.ca/~scshunt/mj-reference-wip.pdf 10:00:42 Consider it noted. 10:10:04 I wonder, can we define a turing complete language as a language which can generate every possible infinite output in infinite time? 10:10:53 what does 'every possible' mean 10:11:30 each and every 10:12:03 or could we give this definition a new name? 10:12:09 what form does the output take? 10:12:24 a string of characters, from a finite alphabet 10:12:52 or an infinite alphabet or space such as the real nmbers 10:12:54 numbers* 10:13:40 does 'every possible infinite output' include the binary expansion of chaitin's constant 10:13:42 ? 10:13:57 yes 10:14:15 then no, we can't define a turing complete language that way :P 10:14:16 In any case, I think this doesn't do what you want, because /deterministic/ TMs can only do this if you also allow infinite input, but stupid machines (which just copy an infinite input or generate a random stream of output characters) satisfy the definition. 10:14:56 oh 10:14:58 right... 10:15:02 (randomness can be regarded as a special kind of infinite input) 10:15:21 anyway 10:15:48 I want to get a programming language for which I can design an interface which looks and feels like a professional business suite 10:20:10 -!- oerjan has quit (Quit: Later). 10:28:40 -!- rdococ has changed nick to rdococ_afk. 10:48:00 -!- rdococ_afk has quit. 10:49:30 -!- AnotherTest has quit (Read error: Connection reset by peer). 10:53:12 -!- AnotherTest has joined. 11:31:09 -!- TodPunk has quit (Read error: Connection reset by peer). 11:31:35 -!- TodPunk has joined. 11:33:10 -!- paul2520 has quit (Ping timeout: 240 seconds). 11:44:53 -!- fractal has quit (Ping timeout: 256 seconds). 11:45:29 -!- stalem has joined. 11:52:36 -!- FreeFull has quit (Ping timeout: 244 seconds). 11:54:43 -!- FreeFull has joined. 11:58:10 -!- fractal has joined. 12:00:33 -!- paul2520 has joined. 12:02:48 -!- J_Arcane has quit (Ping timeout: 255 seconds). 12:06:01 -!- Patashu has quit (Ping timeout: 246 seconds). 12:06:26 i have some thoughts about how to approach writing an interpreter, but i'd like to know if it would be the right approach if anyone is willing to lend some help 12:12:35 what's your approach? 12:18:07 i'm thinking the lexer/tokenizer goes through the source character by character, depending on what character it detects, call a lexer function specific for each type of character related to the functions of the language 12:18:12 (i hope i'm making any sense) 12:18:48 each of these functions either continues to recursively parse the source, or when encountering a closing char, returns the token array 12:18:55 -!- Patashu has joined. 12:19:08 but i'm afraid it's going to be a whole lot of parser functions 12:21:26 i'm also really unsure how to even begin categorizing and interpreting the tokens, but then again maybe the best approach is just to dive into it and solve each problem as i go. 12:22:04 the lang i'm going to interpret is this btw http://pastebin.com/gnd67AKg a sense of what needs to be done might help 12:39:30 -!- J_Arcane has joined. 12:48:45 i'm starting to wonder if the problems that arise are due to it being a badly designed language 12:55:48 -!- FireFly has joined. 13:14:54 [wiki] [[Churro]] M http://esolangs.org/w/index.php?diff=43972&oldid=42975 * Ashl * (+24) 13:15:15 -!- FireFly has quit (Ping timeout: 244 seconds). 13:48:20 -!- FireFly has joined. 14:13:40 -!- AnotherTest has quit (Ping timeout: 244 seconds). 14:16:04 -!- AnotherTest has joined. 14:19:19 -!- FireFly has quit (Ping timeout: 244 seconds). 14:23:19 -!- bb010g has joined. 14:26:04 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 14:30:29 -!- Phantom_Hoover has joined. 14:32:07 [wiki] [[Talk:HQ9+]] http://esolangs.org/w/index.php?diff=43973&oldid=16691 * LegionMammal978 * (+115) /* Proving all the tasks are possible */ 14:32:21 [wiki] [[Talk:HQ9+]] http://esolangs.org/w/index.php?diff=43974&oldid=43973 * LegionMammal978 * (+101) /* Proving all the tasks are possible */ 14:32:22 -!- sunnymilk has left. 14:48:10 -!- Patashu has quit (Ping timeout: 250 seconds). 14:52:18 -!- FireFly has joined. 15:26:43 -!- rdococ has joined. 15:26:51 -!- yorick has quit (Remote host closed the connection). 15:28:44 hey guys 15:29:06 -!- yorick has joined. 15:31:36 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds). 15:37:02 stalem: I feel like you have the right approach here. 15:37:07 -!- FireFly has quit (Changing host). 15:37:07 -!- FireFly has joined. 15:39:25 My instinct would be to do pretty much what you just said. 15:39:27 You might end up with a whole lot of functions. But if you need to do a whole lot of different things, then having a whole lot of functions is correct. 15:45:14 tswett: haha i guess that makes sense. the main issue tho would be to preparse the [x]n and x..n parts, but as they're only two kinds of checks it might suffice to have exceptions for those 15:45:59 At least for [x]n, you might want to do it in two steps. First, do a preprocessing phrase where you process [x]n but just leave everything else as-is. Second, parse everything else. 15:47:34 -!- Phantom_Hoover has joined. 15:48:16 that would actually be a great idea. i could just pass the char array to a preparse function that checks for [x]n, inserts x n number of times and return the resulting array 15:48:31 then pass that result to the main parser 15:49:00 -!- AnotherTest has quit (Read error: Connection reset by peer). 15:53:17 although i guess it would be called a preprocessor :P 15:53:45 -!- AnotherTest has joined. 16:08:44 -!- stalem has changed nick to stale-food. 16:18:09 -!- FireFly has quit (Ping timeout: 244 seconds). 16:25:46 -!- JesseH has joined. 16:29:13 It also depend what programming language you are going to write it with 16:29:31 ?messages-loud 16:29:31 stalem said 1d 4h 8m 21s ago: first iteration of lang generation script done! gonna try and write up a desciption and you can have a look 16:43:02 -!- tjt263 has joined. 16:49:56 -!- FireFly has joined. 17:06:46 -!- MDream has changed nick to MDude. 17:11:06 I want to write a better terminal emulator / ssh client for Windows 17:11:34 -!- sedirc has joined. 17:11:53 !learn sedirc i'm a bot written in sed, my source is here: https://gist.github.com/izabera/345327710e70c10c4e45 17:11:54 Ok, izabera 17:12:08 factoids are per channel 17:12:42 that counts as esoteric, doesn't it? 17:13:03 written in sed? 17:13:07 yes 17:13:33 cool 17:13:49 I used to be quite good with Visual Basic on XP 17:14:11 Maybe I can write a better terminal/ssh thing with VB? 17:17:06 it should theoretically be possible 17:17:15 Yes it might be 17:17:21 I used VB6 as well 17:17:35 those were the days 17:17:57 I prefer a more esoteric language 17:18:58 there's xterm for cygwin 17:19:17 probably a bunch of other terminals will work out of the box in cygwin 17:19:33 I wrote a gopher client in VB6 17:20:48 zzo38: actually c# ;_; only useful lang i know that i'm currently fluent in 17:21:26 I think xterm is a pretty good terminal emulator though, although there are some things I would have omitted as well as some things it lacks but should include. 17:22:48 such as? 17:23:12 -!- rdococ has left. 17:23:40 I would add a resource that contains codes which the terminal interprets (as if it had received) whenever the terminal is reset, therefore you can change various settings with it that cannot be set with other resources (also it mean some other resources are not needed) 17:24:32 Also some Tektronix features are not currently emulated 17:24:39 yes there is cygwin, but I think it would be nice to have something with ssh integration but not crappy like Putty 17:25:06 (I'm using a cygwin terminal right now) 17:25:44 cygwin has ssh, I use it all the time 17:25:53 So I'mma have a "Connect" menu, with options "SSH", "Raw TCP", "Raw Secure TCP" 17:25:58 Sgeo: 17:26:06 right but not integrated 17:26:15 What, you mean with a GUI? 17:26:18 Yeah 17:26:46 -!- Lymia has quit (Quit: Hugs~ <3). 17:26:47 I guess I personally find typing more convenient 17:26:55 ^ 17:27:10 and cygwin isn't an EXE you can just dump on some guy's computer 17:28:04 -!- nisstyre has quit (Ping timeout: 250 seconds). 17:28:25 Some DEC features are not implemented in xterm either 17:28:43 I would also want ANSI music support 17:29:38 zzo38: that could actually be somewhat possible if the ssh program is in the gui program... 17:29:49 -!- Lymia has joined. 17:37:51 -!- darkl0ck has joined. 17:43:07 -!- Sgeo has quit (Quit: Leaving). 17:43:10 -!- bb010g has quit (Quit: Connection closed for inactivity). 17:48:51 windows git dist comes with ssh and a few other unix utils, lighter weight install than cygwin, if you just want a partial unix cmd set 17:56:46 -!- nisstyre has joined. 18:47:06 holy shit 18:47:08 tcpcon = New Net.Sockets.TcpClient(host, port) 18:47:19 fuck 18:48:12 I spent so much time writing C that i forgot what speaking a highlevel language feels like 18:49:12 This is something that even C could do a lot better. int fd = tcp_client(host, port); is a *perfectly doable* API that BSD sockets doesn't have. :) 18:49:37 right 19:01:09 -!- Melvar` has joined. 19:02:21 -!- idris-bot has quit (Ping timeout: 256 seconds). 19:02:27 -!- Melvar has quit (Ping timeout: 244 seconds). 19:03:59 see http://man.cat-v.org/plan_9/2/dial 19:05:17 -!- idris-bot has joined. 19:05:42 -!- Melvar`` has joined. 19:07:51 -!- Melvar` has quit (Ping timeout: 260 seconds). 19:10:18 what do they use to generate the web version of those pages? 19:11:44 Yes you could make the library that does that kind of "tcp_client" though, I suppose 19:14:08 izabera: you could /join #cat-v and ask :P 19:14:19 i actually was already there and i asked 19:14:20 <.< 19:14:25 oh :P 19:14:27 i'm not on there 19:14:45 well, was not 19:17:48 Such function could be made also to automatically select IPv4/IPv6, as well as to automatically do other stuff (possibly based on pseudo-TLDs and so on in the host name), etc 19:19:13 I still am trying to think of what other stuff to write to add into the character back story. He may be here soon! 19:20:03 zzo38: IPv4/IPv6 autoselection should be trivial even in normal BSD sockets if you just use getaddrinfo. 19:20:32 (getaddrinfo returns a linked list of things to try connecting to, in preferred order. So you iterate through, try IPv6, and then IPv4) 19:22:09 However I suggestion something else too, which is pseudo-TLD so that if you end a domain name with .ipv4 then it will strip out the .ipv4 and then connect normally but force IPv4 to be used instead of IPv6 19:24:55 [wiki] [[Dogescript]] http://esolangs.org/w/index.php?diff=43975&oldid=40983 * LegionMammal978 * (+9) 19:26:46 zzo38: you could sort of implement that, if you chose a prefix that's a little longer, by buying a domain name and running special purpose name servers serving it that query name servers and filter to ipv4 19:27:01 but I don't think it's an idea I like in first place 19:27:03 It is meant to be a pseudo-TLD though and not a real one 19:29:07 Now, which control should I use to display the text from the server? 19:29:15 and from the client 19:29:39 I am thinking maybe a Rich Text box? 19:30:00 oren: I was expecting just draw it into a picture box 19:30:19 Hmm that might be simpler actrually 19:30:23 Yeah good idea 19:30:35 A text box work for receiving text from a gopher server (although you have to use Windows API to make long enough text), but for a terminal emulator I think a picture box would be better. 19:31:45 oren: um, what are you developing? 19:31:49 -!- tjt263 has quit (Ping timeout: 265 seconds). 19:33:05 -!- rdococ has joined. 19:33:06 A terminal emulator/ssh/tcp client 19:33:11 In Visual Basic 19:33:30 to get my hand in VB again 19:33:49 we need some kind of esoteric basic 19:34:02 I think there are several 19:34:12 -!- ais523 has joined. 19:34:16 true 19:34:55 BFBASIC 19:35:04 [wiki] [[Special:Log/delete]] delete * Ais523 * deleted "[[File:Sesame oil sample.jpg]]": unused offtopic image, possibly copyvio 19:39:52 Also there was a BASIC/Lisp hybrid that i can't recall the name of 19:40:09 oh yes. Heresy 19:40:37 what heresy 19:40:58 https://github.com/jarcane/heresy 19:42:33 brilliant name 19:46:50 which part is basic-like? 19:47:14 -!- hppavilion[1] has joined. 19:47:56 Hellu 19:48:24 hi 19:49:55 heppalo! 19:50:04 Hi 19:50:23 Playing MC with my sister, so my presence will be thin 19:50:46 I'm writing a terminal emulator in Visual Basic. is this 1. awesome 2. horrible 3. both? 19:51:10 oren: both 19:52:52 yeah, definitly both, but a bit more horrible than awesome, i think 19:53:07 -!- AnotherTest has quit (Ping timeout: 260 seconds). 19:53:33 oren: how feature complete do you want it to be? just a dumb terminal that support \r \n \b but no other control? more? 19:55:10 b_jonas: A terminal that fails to implement ANSI escapes kinda sucks. 19:55:33 oren: and what library are you using to implement the ssh part? 19:55:54 I want it to implement as much as possible. 19:56:33 There's some real crazy terminal features that probably aren't worth implementing. 19:57:05 Such as tektronix graphics. :) 19:57:08 -!- AnotherTest has joined. 19:57:12 I havent' got to the ssh part yet, I'm working on raw tcp 20:00:15 I practically guarantee you won't care to implement tektronix graphics. Though, if you really *must*, you could probably use xterm as a reference. 20:01:23 If I have to, I'll implement ssh myself. but it looks like .Net has an ssl interface 20:01:47 I dunno if that'll be helpful. SSH isn't SSL. 20:02:03 Though I imagine .Net is also exposing the crypto functions, which should help. 20:02:16 exactly what i'm thinking 20:02:18 The protocol's different, but the crypto is the same. 20:02:26 (for the most part) 20:10:04 -!- Melvar`` has changed nick to Melvar. 20:17:37 -!- stale-food has changed nick to stalem. 20:39:24 -!- hppavilion[1] has quit (Ping timeout: 255 seconds). 20:41:36 -!- TieSoul has quit (Remote host closed the connection). 20:42:50 hey guys quick q: is it normal for a lexer/parser to contain lots of if/then/else statements? 20:43:36 -!- APic has quit (Ping timeout: 264 seconds). 20:43:39 ais523: stalem mentioned that he's writing some sort of lexer or parser that uses separate recursive functions for each state, or something like that. I think you can help him. 20:44:05 recursive descent, or recursive ascent? 20:44:09 stalem: either that or switch statements 20:44:38 lexers often are literally state machines; parsers tend not to be mathematically identical to state machines but have a lot of features in common 20:45:17 yeah it's pretty much like that. thing is, i'm only at the first condition in the _preprocessor_ and i have already a nest building 20:45:25 i'm thinking the lexer/tokenizer goes through the source character by character, depending on what character it detects, call a lexer function specific for each type of character related to the functions of the language” 20:45:29 ais523: ^ 20:45:39 what's the key difference between a lexer and a parser then? 20:46:01 stalem: a lexer is splitting the input into tokens, and traditionally takes a regular language as input; there's no "long-range" state 20:46:05 i'm not too knowledgeable in all the terminology, but i'm gonna learn! 20:46:09 you're just trying to recognise words / punctuation groups 20:46:21 meanwhile, a parser is splitting a list of tokens into a nested structure, so it can do things like matching brackers 20:46:24 *brackets 20:46:30 a lexer recognizes a _sequence_ of tokens, a parser makes a _tree_ from a stream of tokens (sometimes called "symbols" in that context) 20:46:40 and normally is based on a context-free language 20:46:52 ah ok, so pipelined it would be lexer > parser > interpreter/compiler? 20:47:06 stalem: yes 20:47:14 neat! 20:47:23 actually often the lexer's implemented as a subroutine of the parser 20:47:32 the parser calls the lexer whenever it needs more tokens 20:48:37 i see. are there any obvious benefits to doing that rather than tokenize then pass the array to a parser? 20:49:25 memory usage, mostly 20:49:36 you don't need to allocate a temporary array for keeping the token list around 20:51:06 very true. i'll tackle that hurdle when i get there. thanks for the wisdom! 20:51:41 so in conclusion, this nesting isn't all that uncommon then? http://pastebin.com/kFNEhnRC 20:52:04 -!- hppavilion[1] has joined. 20:52:13 Hellu 20:52:20 greetings! 20:52:35 insert clever greeting pun on the name "stalem" here! 20:52:48 Stallom, perhaps? 20:52:56 stalem: what you're writing there is basically a state machine 20:52:58 shtallom even? 20:53:01 Sthelloem? 20:53:08 just using separate variables rather than a single "state" variable, so it looks a bit different from normal 20:53:28 this is pretty much what I expect to see in a lexer 20:54:23 What's he trying to make? 20:54:25 ais523: oh. well it's just the preprocessor but i guess i'm doing something right? when you mention state machine i get unsure. sheesh i feel i have so much to learn still hah 20:54:28 A Parser using an FSM? 20:54:48 hppavilion[1]: stalem's working on a lexer/parser 20:54:49 what? I always thought "stalem" just stands for "stalemate" 20:54:52 hppavilion: i'm trying and failing it seems 20:54:55 With an FSM? 20:54:56 LOL! 20:54:59 it isn't explicitly using an FSM atm 20:55:01 b_jonas: indeed it does 20:55:01 N00B! 20:55:04 ok 20:55:05 ;_; 20:55:09 It's ok 20:55:12 hppavilion[1]: err, you do realise that like 99% of lexers are FSM-based? 20:55:17 We were all n00bs once 20:55:26 ais523: I was talking about the parsing part 20:55:29 i'm just too old to be a n00b imo 20:55:46 hppavilion[1]: stalem hasn't really started on the parsing portion yet 20:55:51 I know lexers are FSM based. I've written many in my life, all of which are regex-based 20:55:52 Ah 20:55:56 just the preprocessor 20:56:00 stalem: you _could_ try to read a book about lexing and parsing though, if you're interested in this 20:56:03 and yes, we know that unless the language is very simple, then a state machine is insufficiently powerful to parse it 20:56:05 stalem: NO LONGER A N00B! 20:56:25 :O that was quick! how did i do that? 20:56:40 If it has parenthesis that must be matched, it needs at least a Stack Automaton 20:56:42 b_jonas: i got a lot of free time, that's a great idea. could you recommend any good ones? 20:56:52 I read fsm as flying spaghetti monster >.> 20:56:53 Preferably something like Backus-Naur Form 20:56:56 We all do 20:57:01 They are One and the Same 20:57:08 i don't 20:57:13 fowl: that is also good at parsing, but harder to write 20:57:15 You're a n00b then. 20:57:20 i prefer ipu over fsm 20:57:26 stalem: I'm not really sure, because I've seen only a few such books, but 20:57:28 stalem: What language are you using? 20:57:48 let me find the two I've read recently when I realized I know too few about context-free parsing 20:58:02 I still know too little, mind you, but the books are good 20:58:08 b_jonas: heh fair enough! 20:58:23 hppavilion[1]: c# :/ 20:58:25 and I'd still want to learn more 20:58:32 stalem: C# is fine. 20:58:42 I prefer Python, but that's because I'm a n00b 20:58:49 i wrote a lexer for rail. it was fun 20:58:49 I really like calling people n00bs today 20:59:01 not the optimal language, but i feel like learning stuff on my own at this time, with my uneducated arse, is gonan be a bit too much right now 20:59:08 C# has Operator Overloading, right? 20:59:25 no idea actually. i understand python is really powerful though? 20:59:28 If so, you can makes something that looks like BNF pretty easily 20:59:31 It is 20:59:46 stalem: a deep but old classical book is Aho, Ullman, ''The theory of parsing, translation, and compiling'' 20:59:48 It's dynamically typed, it has built-in maps, it has a bajillion libraries 20:59:58 thing is, i should propably learn a bit more about processing streams of chars and tokens before i delve into BNF 21:00:07 It has ever operator overloading thing you would need 21:00:10 You can overload operators 21:00:16 ON THE RIGHT-HAND SIDE 21:00:23 b_jonas: thanks, adding to my notes! 21:00:48 -!- x10A94 has quit (Read error: Connection reset by peer). 21:01:11 stalem: I recommend using Parser Combinators to generate an AST 21:01:17 hppavilion[1]: by operation overloading do you mean overloading stuff like + etc? 21:01:22 Yess 21:01:25 s/ss/s/ 21:01:38 hm no i don't think it can no, but then again i havne't looked into it :P 21:01:50 But that's just because the only ways I know of parsing are Parser Combinators and the Shunting-Yard Algorithm (which only works for arithmetic expressions) 21:01:53 I think it can, actually 21:02:01 http://www.jayconrod.com/posts/38/a-simple-interpreter-from-scratch-in-python-part-2 21:02:10 That's a good article on parser combinators 21:02:23 stalem: before that, I've read Hopcroft, Motwani, Ullman, ''Introduction to Automata Theory, Languages, and Computation''. This requires very few prerequisites and contains good explanations, but also covers a lot of theory-only non-practical stuff, like the double-exponential reduction to two-counter machines 21:02:24 It's easy to understand, because python looks like pseudocode 21:02:46 brb guys 21:02:53 I didn't learn too much of it, but it was remarkable to me because of the nice style it was written 21:04:29 There's also Knuth's TAOCP volume 5 for lexing, and possibly volume 6 “God willing […] but only if the things I want to say about those topics are still relevant and still haven't been said” (according to Knuth) 21:04:46 no wait, volume 5 is also about parsing 21:04:54 well, I'm not sure how they're divided really 21:04:59 so anyway, volume 5 21:05:54 -!- Patashu has joined. 21:08:06 phew very much to take in and learn 21:08:32 things is i gotta go now, up early tomorrow 21:08:54 thanks for the great wisdom guys i appreciate your help! 21:09:14 and for the book tips and links as well ofc 21:09:18 someone should suggest other books though 21:09:21 I'm making an Uber-Simple Imperative Langauge for learning the basics of programming 21:09:24 because I only gave one useful book tip 21:09:36 It's for wrapping your head around concepts more than for being useful 21:09:43 What should I call it? 21:09:49 its always a start! 21:09:54 It'll probably look like Lua 21:10:08 There'll be ones for all sorts of paradigms 21:10:10 couldn't help you there sorry, domain terminology still also evades me 21:10:14 bye for now o/ 21:12:28 stalem: what's your background? it may help someone suggest a more approperiate book 21:12:44 hppavilion[1], lua is neat 21:13:12 I'm calling the Pythonic Imperative langauge BasiCode which is a very stupid name 21:13:21 But it's all I can think of 21:13:30 You could call your language "B.A.L.I.C" 21:13:38 This is going ot be a high-level langauge 21:13:44 I'll also make a fake low-level langauge 21:13:53 *language *language 21:13:56 beginners all-purpose learn-stuff instruction code 21:14:26 Beginner's All-purpose Learning Tutorial Introduction Code perhaps? 21:14:27 -!- stalem has quit (Ping timeout: 246 seconds). 21:14:29 BALTIC 21:14:57 KISSLTIRCAAAUBNR 21:15:08 My ancestory is Norwegian, so that's an appropriate name 21:15:13 I'll go with it 21:15:26 Beginner's All-purpose Learning Tutorial Imperative Code 21:15:55 i forgot what the last name i suggested stood for 21:16:31 beginners all-purpose learn-stuff instruction code 21:16:46 No, KISSLTIRCAAAUBNR 21:16:50 Ah 21:17:04 JesseH: Do you want to help me figure out what the language should look like? 21:17:10 sure! 21:17:19 OK 21:17:24 You good with Google Docs? 21:17:37 It's my document system of choice for now 21:18:31 JesseH? 21:18:55 I studied google docs in college for many years. 21:19:08 Link me to your doc. 21:19:14 OK 21:19:18 Let me finish making it xD 21:19:19 Oh, are you a Google PhDocs now? 21:19:26 ... 21:19:31 `` words --esolangs 20 # more names 21:19:32 best cola/m recurscript furse highfiverow goto++ philosophy divzeros bull suff muxcon ora dog chiewuddled bfjouse oddbal ora sendex.php pi ork 21:19:32 That is amazing 21:20:13 Somehow that manages to not look like 20 words, even though it is. 21:20:32 `` words --derplangs 20 21:20:34 Unknown option: derplangs 21:23:31 `words --list 21:23:32 valid datasets: --eng-1M --eng-all --eng-fiction --eng-gb --eng-us --french --german --hebrew --russian --spanish --irish --german-medical --bulgarian --catalan --swedish --brazilian --canadian-english-insane --manx --italian --ogerman --portuguese --polish --gaelic --finnish --norwegian --esolangs \ default: --eng-1M 21:24:00 `` words --finnish --swedish --norwegian --esolangs 20 # let's get some northern esolangs here 21:24:03 maican mdpn sink 2iotackarttin velang smentrasseen bordinsomre expantuva hånds abc ars sydämpämmerar 6ix ojäädess ystelladadach kistavlöps kabitchica aukturein eleckey varm 21:24:10 `` words esolang # == derplang 21:24:12 Argument "esolang" isn't numeric in int at /hackenv/bin/words line 148. 21:24:19 I dont understand this 21:24:51 It's just running shell commands. The command in question takes the above-listed flags, and a single non-flag argument, which is the number of words. 21:27:16 `` words --esolangs 20 21:27:17 toi udageunshacking smithb bitbit regexpl thue ane twiseporisp minimal bogu oddball thisesol sher hargh! brainfuck oof itflipt xigxag bare c- 21:27:35 I am very amused at "brainfuck" showing up literally 21:27:47 it must be a very common nonagraph in esolang names 21:28:12 Fun fact: "nonagraph" is a nonagraph. 21:28:29 Probably not a very common one. 21:28:30 it's not necessarily a real word, I tried my best to reverse-etymologise one though 21:29:13 -!- ais523 has quit. 21:33:12 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 21:42:10 -!- Patashu has quit (Ping timeout: 240 seconds). 21:45:05 [wiki] [[QKAS]] http://esolangs.org/w/index.php?diff=43976&oldid=43441 * 96.59.227.171 * (+5) fixed link 21:56:48 -!- rdococ has quit. 22:00:10 i'm 23 22:00:12 happy birthday to me 22:00:27 What's the netcat incantation to listen and send a string to whoever connects? 22:00:56 happy birthday izabera 22:03:01 I'ts wrikng !!!!1111 22:03:10 well kinda 22:04:03 I successfully sent "Hello, Wor" to my terminal 22:05:21 Still needs a ton of work 22:12:56 So I'm making a Terminal/CLI/Shell/whatever based on Data Structures 22:13:50 I'm looking for the best data structures to include 22:15:19 You know what'd be a cool language? 22:15:29 Splay trees, mostly because of the nomenclature. 22:15:42 One where you declaratively define machines that perform the task for you 22:15:48 I'll investigate those 22:15:52 Splaying involves zig, zig-zig and zig-zag steps. 22:16:18 Oh 22:16:30 I'm going for more abstract data structures than implementations 22:16:53 Well 22:16:55 ACTUALLY 22:17:05 I'm just being horribly inconsistent with what I choose 22:17:33 I'm going by the general rule that their design has to be more abstraction-based than based on how you concretely implement it 22:19:41 Well. I was going to say Bloom filters next, because I hear they're very trendy, but that too might not be "abstract" enough by your definitions. It's just a particular kind of probabilistic set. 22:19:54 Oooh 22:19:57 I like bloom filters 22:20:06 I included them already though xD 22:20:29 I think I might actually have enough Data Structures already :P 22:21:36 Array, Vector, LinkedList, SkipList, Stack, Queue, Deque, Tape, Set, Bag, BinaryTree, Tree, Graph, BloomFilter, Database 22:21:40 zzstructure? 22:21:50 ? 22:22:23 https://en.wikipedia.org/wiki/ZigZag_%28software%29 22:22:37 Also, how is BloomFilter a kind of data structure? 22:23:32 It's a way of storing pieces of data 22:24:00 But I don't know anything about it other than it sharing a name with a type of image editor filter? 22:24:19 Huh 22:24:27 And Wikipedia says nothing. 22:24:34 Basically 22:24:40 You have a set of k hash functions 22:24:45 And a bitarray of size n 22:24:50 Oh wait no here it is. 22:24:56 https://en.wikipedia.org/wiki/Bloom_filter 22:24:57 There you og 22:24:58 I know 22:25:03 I've read that article before 22:25:08 It's my favorite DS 22:25:14 Yeah, I was just letting you know I found it. 22:29:32 Ah 22:29:46 There was something really fancy about how to one-pass count an approximation of top-k (per frequency) elements from a stream. It was something related to a count-min sketch, I think, but fancier. I just can't find it any more. 22:30:40 Maybe it was this thing: https://icmi.cs.ucsb.edu/research/tech_reports/reports/2005-23.pdf 22:30:43 Getting a bit irrelevant here, but anyway. 22:39:16 -!- APic has joined. 22:43:30 whoa whoa whoa 22:43:42 randomized data structures aren't irrelevant here 22:44:09 and CMS et al. are great hth 22:52:09 I do not understand graph rewriting :/ 22:53:15 What is the name of the data structure that is like a binary tree, but where the left child of the right child of a given node is the same node as the right child of the left child of that same node? 22:53:25 (0) 22:53:31 / \ 22:53:43 I can't draw it 22:55:29 The dreaded diamond? 22:55:51 (0) 22:55:58 / \ 22:56:04 (1) (2) 22:56:11 / \ / \ 22:56:20 (3) (4) (5) 22:56:24 Roughly, that 22:56:37 so, basically you get one more child per depth, i don't think that's interesting 22:56:52 I don't want it to be interesting 22:57:01 I just want to know what it's called if it's a reall thing 22:57:03 *real 22:57:15 And if it is, why it would ever be useful 22:57:28 I mean, of course it's a real thing 22:57:34 But a real thing that people actually use 23:01:56 fizzie: Not the Deadly Diamond of Death 23:02:02 That's entirely different 23:03:44 I want to make a simple EsOS with Python and TK 23:03:46 Arguably, Pascal's Triangle has that sort of structure. 23:03:49 Not an actual OS 23:04:44 Anybody here know Python and feel like helping? 23:07:14 I would think it would mostly be good if you're using data representing a triangle. 23:07:28 True 23:07:28 Much like a matrix is good for data representing a rectangle. 23:07:34 Oooh 23:07:43 Triangly matrices would be kewl 23:07:58 Mathemeticians- Research! 23:08:24 <|f`-`|f> hppavilion[1] biparental heap? 23:08:52 |f`-`|f: Possibly, but I don't think it need be a heap 23:09:04 <|f`-`|f> ok 23:09:12 Also, it isn't ALWAYS biparental, as you can see from (3) and (5) and (1) and (2) 23:09:16 Pascal's Treeangle? 23:09:25 <|f`-`|f> null pointers :^) 23:09:35 Fair enough 23:09:55 So does no one here know python and feel like _finally_ pumping out _some_ sort of EsOS? 23:10:26 I don't know python. 23:10:30 Oh 23:10:34 Do you know anything about design? 23:12:00 For example, would you know how to make something that felt weird as shit? 23:12:03 there is an eso OS 23:12:26 it had 3 commands 23:12:41 Are you talking about Petrovich? 23:12:46 do something [with file], punish, treat 23:12:52 Yes you are 23:12:58 okay 23:13:01 I'm talking about implementing something 23:13:13 And something that is actually easy to do, too 23:13:39 myname: Do you want to help with the EsOS? 23:13:54 what should it do? 23:14:09 It needs to be weird and be able to be implemented in Python :P 23:14:21 I know how do design for weird, yeah. 23:14:31 I'm thinking use a completely different system of files from what anyone else has ever seen for starteers 23:15:00 There's OSes I would like to make, but I ought to actually program more first. 23:15:07 that sounds more like an esoFS 23:15:44 Rather than make OSes beore I have any idea how to make programs that do things other than let you use other programs. 23:15:52 I'm implementing this in Python since that's much easier 23:15:53 there are some interesting fses in the arch forums 23:16:10 If anyone anyday decides to implement it on a machine level, that'd blow my mind 23:16:18 Also interesting ideas for shells. 23:16:29 Do you like google docs MDude and myname? 23:17:02 All code is to go in https://libraryofbabel.info/ 23:17:42 What's that exactly? 23:18:05 And is that directed at me? 23:18:10 An infinite library, but it's all in lower case with only "," and "." for punctuation. 23:18:18 Ah 23:18:22 Right 23:18:25 So code would need to be in a language that can use just those. 23:18:30 I forgot about The Library of Babel 23:19:16 You can search for pages and make bookmarks, which makes it usable as a substitute for pastebin. 23:20:07 Interesting 23:20:41 I was planning on keeping stuff on GitHub 23:35:06 * hppavilion[1] sighs 23:35:48 -!- APic has quit (Ping timeout: 264 seconds). 23:36:18 myname, I don't think I got a clear answer. Would you like to help with the EsOS? 23:37:26 i'd like to, but i'm not sure if i'm that helpful 23:37:39 -!- variable has joined. 23:37:47 Hi, variable! 23:39:08 myname: I'm sure you could be helpful. I mean, I'm useless, so... 23:39:15 -!- APic has joined. 23:45:26 -!- Sgeo has joined. 23:53:06 -!- APic has quit (Ping timeout: 240 seconds). 23:57:30 -!- hppavilion[1] has quit (Ping timeout: 244 seconds). 23:58:22 Unless I can edit Google Drive without loggin in, I would prefer something else.