00:05:56 -!- Sgep has joined. 00:06:56 300[-2|*-2]*-1 'NOT: -2 = NOT(*-2) 00:07:33 301[-2|*-3,-2|*-2]*-1 'AND: -2 &= *-3 00:07:55 302[-2|*-2,-4=*-3,-4|*-4,-2|*-4]*-1 'OR: -2 |= *-3 00:08:18 303[-4=*-3,-4|*-4,-4|*-2,-2|*-2,-2|*-3,-2|*-4]*-1 'XOR: -2 ^= *-3 00:08:39 304[-2|*-2,-4=*-3,-4|*-4,-2|*-4,-2|*-2]*-1 'NOR: -2 = ~(*-2 | *-3) 00:09:02 305[-4=*-3,-4|*-4,-4|*-2,-2|*-2,-2|*-3,-2|*-4,-2|*-2]*-1 'XNOR: -2 = ~(*-2 ^ *-3) 00:09:04 -!- Arrogant has quit ("I AM QUIT HAVE A NICE DAY"). 00:09:21 306[-3=*-2,-2=0,-2-*-3]*-1 'NEG: -2 = -*-2, -2 = !*-2 00:09:53 * Sgep becomes dizzy 00:10:36 Sgep: using NAND to construct the other logic operators 00:11:05 NOT p = p NAND p 00:11:32 p AND q = (p NAND q) | (p NAND q) 00:11:46 whoops :) 00:11:49 p AND q = (p NAND q) NAND (p NAND q) 00:11:50 ;) 00:12:02 p OR q = (p NAND p) NAND (q NAND q) 00:12:19 calamari: is this online somewhere? 00:12:29 probably 00:12:48 If it isn't, I can put it online 00:13:05 I've created a file of it 00:13:13 so I'll put that up in the linguine distro 00:13:36 I did find XOR online, (Mathworld) 00:13:47 It happens to be one NAND shorter than jix's 00:14:07 note: NAND = | 00:14:34 p XOR q = (p|(q|q)) | ((p|p)|q) 00:17:31 it's possible that NOR and XNOR could be made shorter 00:17:50 because I'm simply doing another NOT at the end and that may not be optimal 00:23:19 afk 00:24:19 -!- Sgep has quit. 01:13:37 -!- GregorR[notHome] has changed nick to GregorR. 01:27:11 -!- Sgep has joined. 02:32:04 -!- CXI has joined. 04:25:35 back 04:40:05 cool... 4 nand xor: 303[-4=*-3,-4|*-2,-2|*-4,-4|*-3,-2|*-4]*-1 05:35:49 -!- Sgep has quit. 05:38:01 -!- CXI has changed nick to AMouseXI. 05:40:26 -!- AMouseXI has changed nick to CXI. 05:54:08 -!- kipple has quit (Read error: 110 (Connection timed out)). 07:00:34 -!- Robdgreat has joined. 07:14:56 cya alll 07:14:57 -!- calamari has quit ("Leaving"). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:41:27 -!- Keymaker has joined. 08:50:03 -!- Keymaker has quit ("IRCAI :: Internet Relay Chat Artificial Intelligence v. 0.3 beta :: Please report bugs!"). 09:14:29 -!- CXII has joined. 09:36:59 -!- CXI has quit (Success). 10:55:57 -!- kipple has joined. 11:23:01 -!- jix has joined. 12:16:54 calamari: i just did ((a or b) and not (a and b)) => ((a or b) and (a Nand b)) => ((not a Nand not b) and (a Nand b)) => not ((not a Nand not b) nand (a Nand b)) (not is done using a nand a) 14:13:01 -!- int-e has joined. 14:26:04 -!- Gs30ng has joined. 14:26:09 long time no see 14:28:28 identify yourself 14:28:38 how 14:30:03 you know 14:30:16 no 14:30:19 tell me 14:30:50 first, state your identification 14:30:57 second, finish your statement 14:31:12 hmm 14:32:21 still don't know... why don't you first identify yourself? that'll be a guide for me 14:32:52 because. 14:33:32 아발발다빠따반반나다발딸발발다빠따따맣발발다뿌 14:33:33 희멓터벅더떠벋떠벌더벌벌떠벌떠더법벍떠더벌벌떠 14:33:34 oops 14:33:44 oops 14:34:07 impossible to see any utf-8 character... mIRC sucks 14:36:07 why don't you use telnet? 14:36:26 my windows telnet is on cp949 14:36:50 do you know how to make it utf8-based? 14:37:11 do you know "putty" client? 14:37:23 there's linux, you know 14:37:24 it surpports utf-8 greatly. 14:37:36 oh, well, i use it for ssh connection... 14:38:02 -!- Freya has joined. 14:38:06 but well, IRC with a telnet client is... well crap it sucks more than mIRC 14:38:08 -!- Freya has left (?). 14:39:27 all you have to do is \rJOIN #esoteric and some others 14:39:31 don't you want utf-8? it's good solution for utf-8 chat - except for ping manually. 14:39:39 manual ping 14:39:56 Gs30ng: get xchat 14:40:03 Gs30ng: get xchat 14:40:13 Gs30ng: get xchat 14:40:20 for great justice. 14:40:30 jix, i'd love to but my xchat is cracked 14:40:41 who's the bad cracker? 14:40:42 i mean, it totally does not work on my machine 14:40:57 get a new machine 14:41:10 get a new os 14:41:17 get both 14:41:19 DCC-send me a new machine 14:41:22 get a rest 14:42:13 lirthy, nice to meet you... have we already met? 14:42:37 deja vu 14:42:53 or are you a newcomer of esolang community? then, welcome 14:42:53 choose the red pill, and you can see the truth 14:44:01 Blue pill may taste Pepse Blue 14:44:08 s/Pepse/Pepsi/ 14:44:08 lol 14:44:33 lirthy, then DCC-send me both. i'll choose. 14:44:45 don't blame that it's not that bad 14:45:23 i haven't drunken any Pepsi blue... i really wonder how it would be tasted 14:47:05 there's a report of brave man in wikipedia... he said it's much more sugary 14:47:27 is that 'deployment' on topic a typo, or are esolangs truly deployed to our society(maybe secretly)? 14:48:18 "brave man" reminds me of something 14:51:34 ok damn 14:51:36 what 14:51:41 puzzlet, what 14:52:23 i'm waiting for what you say 14:52:52 you are on the way to destruction 14:53:50 dude, that's way out of fashion 14:54:33 jal-jara jal-jajira 14:54:48 ok forget it 14:55:01 yeap forget it 14:55:19 i've got some questions about the language... Brainhype. 14:56:39 Can anybody explain me what {...} instruction does? Description on wiki is kinda hard to understand... Maybe because of my humble English 14:57:00 gimme the url and i'll explain that 14:57:27 thx it's here http://esoteric.voxelperfect.net/wiki/Brainhype 14:58:21 i don't understand it either 14:58:34 why are the citrus placed there anyway 14:59:00 agree 14:59:14 i mean i don't know why either 15:02:40 but anyway i like them 15:03:48 they matches on the wiki... with numerical expressions, with program codes, i think 15:33:37 -!- ihope has joined. 15:37:17 -!- puzzlet has quit (Read error: 104 (Connection reset by peer)). 15:37:47 What paradigm should our Esoteric Operating System be? 15:37:54 ...written in? 15:38:14 linguine! 15:38:19 functional 15:38:25 oh i thought language... 15:38:30 How about imperative, a la Haskell? 15:38:52 haskell is a stack-based imperative language 15:39:06 haskell isn't stack based 15:39:09 and haskell is functinal 15:39:23 Haskell's do notation looks imperative :-) 15:39:24 stack-based imperative = functional 15:39:28 listen 15:39:38 a haskell code 15:39:41 (+) 1 2 15:39:50 this represents 3 15:39:55 applies 1 to + and 2 to 1 applied to + 15:40:09 now a stack-based imperative language 15:40:12 but thats just standard lamda calculus notation nothing stack based 15:40:28 1 pushes 1 to the top of stack 15:40:28 jix:It applies (+) to 1 and then to 2. 15:40:32 it's the same as (((+) 1) 2) 15:40:34 2 pushes 2 to the top of stack 15:40:41 NONONO! 15:40:53 + adds top two values 15:41:04 it's interpreted as (((+) 1 ) 2) 15:41:06 And what about all those piles of syntactic sugar? 15:41:14 then a code 1 2 + 15:41:21 is a reversed haskell code. 15:41:47 Gs30ng: haskell uses currifizing arguments that's why it looks like stack based but it isn't 15:41:59 jix: that's the point 15:42:09 it FIRST does ((+) 1) ... resulting in another function 15:42:18 curry style is kinda stack-based imperative 15:42:20 Infix operators! Hoes do those work? 15:42:20 than it does (this_function 2) 15:42:29 ihope: syntactic sugar 15:42:43 Heh... 15:43:15 jix: well i was just kidding... but aren't they similar? 15:43:26 Yes. 15:43:38 stack-based imperative one could be reversed-curry style functional one. 15:43:46 Gs30ng: take a look at imperative_programming on wikipedia 15:43:58 the 2nd paragraph says it's different from functional languages like haskell 15:44:11 well most of imperative ones are 15:44:17 In computer science, imperative programming, as opposed to declarative programming, is a programming paradigm that describes computation in terms of a program state and statements that change the program state. 15:44:21 but 1-stack based imperative ones aren't 15:44:26 in functional languages there is no local state! 15:44:34 and imperative languages only modify the local state... 15:44:40 so they are different from ground on 15:44:43 i know i know 15:45:52 How about using Enigma as a platform for our operating system? It's a good virtual machine. 15:46:06 but whatever the structure and kernal way it has, apparently 1-stack-based imperative one and functional one are similar 15:46:19 Gs30ng: they arn't similar 15:46:36 They are somewhat similar. 15:46:37 they look a bit similar but they are completely different 15:46:43 Think 0x29A. 15:46:48 we can see the stack itself as an argument of function 15:48:07 of course you can try to combine them but then it's neither functional nor imperative programming... 15:48:27 in functional programming there is no evaluation order.. (that's why haskell uses monads) 15:49:15 No defined evaluation order... 15:49:42 well our computer forces the interpreter to do some evaluation order... 15:50:08 Indeed, there has to be some evaluation :-) 15:50:09 but super parallel computers could evaluate everything at one time... the language doesn't care 15:50:54 Heh, right. 15:51:36 well, without any care of classes, monads, defining functions... state a language with reversed order of haskell 15:51:52 Reversed order? 15:51:56 then 1 2 (+) represents 3 15:52:20 Postfix notation? 15:52:30 and now state a stack based imperative one, 1 pushes 1, 2 pushes 2, + adds top two element... 15:52:35 take lazy-k with reversed source... 15:52:42 then 1 2 + is now 3 15:52:49 Hmm... 15:52:53 and add macros for curch numerals and things... 15:53:00 And what happens when you add all that "tricky" stuff? 15:53:11 they look really similar 15:53:24 ihope, excuse me but what do you mean 15:53:26 let's make it pure functional (like lazy k) 15:53:39 but change the syntax so that it is possible to program in 15:53:54 Lazy K's possible. Very possible. 15:53:56 (macros etc but no recursive macro expansion) 15:54:07 ihope: you program in lazy k without tools? 15:54:15 Yes. 15:54:22 yeah ok it is possible 15:54:40 it is possible to write subskin too so well i guess lazyk too 15:54:55 bbl 15:55:25 But I'd like to make it so Lazy K's programs are compatible with Haskell's IO types. 15:55:55 well, i've been thinking about 2-dimensional functional one 15:56:21 Me too, but not very long... 15:56:55 i've found a way reducing all <>^v 15:57:29 I know the apply operator could be replaced with substituted function composition. 15:57:51 i don't think they are needed for functional one, since they controls the flow 15:58:14 2-dimensional flow control is kinda... it seems it's only important for procedural ones 15:58:22 Aye. 16:04:10 Hey: what if the language itself evolved along with the evaluation? 16:20:27 A program in that language would have to have an interpreter for that program before it. 16:20:44 And the interpreter would have to have an interpreter, etc... 16:33:19 data Maybe Maybe a = Just Just a | Just Nothing | Nothing 16:33:33 back 16:41:23 -!- Gs30ng has quit (Read error: 104 (Connection reset by peer)). 16:53:17 hasta 16:53:25 -!- Robdgreat has quit. 16:58:34 -!- ihope has left (?). 18:04:42 -!- int-e has quit ("Client exiting"). 19:46:02 -!- calamari has joined. 19:47:05 hi 19:48:05 jix: 1[0^]2 19:48:05 2[1=*0,0>1,1|1,1|*1,1<1:3,1#]2 19:48:05 3[3=9223372036854781733,2=*3,2|*0,0|*2,2|*3,0|*2,1#]2 19:49:03 method was from this page: http://www.play-hookey.com/digital/xor_function.html 19:50:40 hehe cool 20:05:08 all the new stuff has been uploaded 20:05:23 you probably have all of it tho 20:07:19 jix: how is your bf text gen going? 20:08:29 i have one lhs working 20:08:34 but it isn't really efficient... 20:17:43 -!- Arrogant has joined. 20:19:01 -!- marcan has joined. 20:44:13 -!- Arrogant has quit (Read error: 113 (No route to host)). 20:46:22 -!- Sgep has joined. 21:09:05 -!- Arrogant has joined. 21:29:13 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 22:08:34 -!- Arrogant has quit ("I AM QUIT HAVE A NICE DAY"). 23:51:27 -!- kipple has quit (Read error: 104 (Connection reset by peer)). 23:52:25 -!- kipple has joined. 23:57:51 wownochat