00:05:48 -!- GregorR-W has joined. 00:05:53 Hullo 00:36:26 hola 00:36:49 Hey! 00:36:55 Could you write this exact line to this channel? 00:37:46 Could I write what exact line to this channel? 00:38:25 Could you write /this/ exact line (the line I am writing, this very question) to this channel? 00:38:51 sure 00:38:57 Could you write this exact line to this channel? 00:38:58 i could 00:39:00 any particular reason why? 00:39:07 I'm trying to make an IRP quine :P 00:39:15 http://www.esolangs.org/wiki/IRP 00:39:44 OK, so now that you know the background a bit better (I want a nice clean log :) ) 00:39:50 Could you write this exact line to this channel? 00:39:57 yes 00:40:06 you just asked my if i could 00:40:10 Damn XD 00:40:15 Please write this exact line to this channel. 00:40:18 if you want us to do it you have to write Please write this exact... 00:40:22 Please write this exact line to this channel. 00:40:53 Please write this exact line to this channel. 00:41:21 Hmmm, Gregor, Im afraid your language has an unusual amount of side effects 00:41:22 Oh no, a recursive quine ;) 00:41:26 it also seems to be nondeterministic 00:41:32 Yes, I marked that ;) 00:41:42 Now let me test some of the programs I posted ... 00:41:48 Please say "Hello, World!" 00:42:04 Hello, World! 00:42:11 Yeee haw! 00:42:20 Goodbye, cruel world 00:42:56 Please say "/quit if this is my quit message I'm stupid" 00:43:10 /quit if this is my quit message I'm stupid 00:43:13 this is a interpreter compatibility check 00:43:19 sorts out bad implementations 00:43:23 Heheh 00:43:29 hmmm, I see 00:43:40 These are the first 16 digits of the fibonacci sequence: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 00:43:45 Please, some one write the first 16 numbers of the Fibonacci Sequence. 00:43:58 the first 16 numbers of the Fibonacci Sequence. 00:44:06 Clever :P 00:44:09 Plus, I wrote 17 up there 00:44:15 So I lose. 00:44:58 Please, compute 3^^^3 00:45:09 I'm not sure what "^^^" means .. 00:45:24 Its power tower notation 00:45:43 it means 3^(3^(3^3)) 00:45:50 Ah. 00:46:49 please tell me the digital root of the largest know prime number 00:47:19 What is the largest known prime number? 00:47:24 Should I calculate it first? :P 00:47:42 GregorR-W: 2^25964951 - 1 00:47:52 Its between 1 and 9 00:47:54 * GregorR-W cracks his knuckles :P 00:48:06 I'll go with 5+- 4 00:48:22 please tell me the exact solution 00:48:24 ... wait. What base? 00:48:28 1 00:48:29 base 10 00:48:31 1 base 2 00:48:32 darn 00:49:04 This is where it becomes clear that IRP is not turing complete ;) 00:49:08 error: out of bounds 00:49:44 GregorR-W: well you can calculate it with a few 32bit integers 00:50:18 If somebody was so inclined, they could write a program and then respond with the proper answer *shrugs* 00:50:31 However, the whole language depends on the inclination of the fellow IRP programmers :P 00:50:45 DigitalRoot_10(2^n) == DigitalRoot_10(2^(n mod 6)) afaik 00:52:56 please print the interpreter's release date. 00:53:12 Sorry, I don't tell my age to people online ;) 00:53:21 GregorR-W: why not? 00:53:46 Because if you knew the truth, /IT WOULD HAUNT YOU FOR ALL ETERNITY/!!!!! 00:54:19 lol 00:54:27 I'm not sure why ... 00:54:48 GregorR, Im already haunted for all eternity. Mostly by guilt and humiliation 00:54:57 Awesome-o. 00:55:08 my release date is 05 Apr 1991 00:55:23 Wow 00:55:50 yeah i'm up-to-date 00:56:05 with all the latest bugs 00:56:55 lol 00:57:08 Sorry, Im just kidding 00:57:26 Wildhalcyon: i think i'm bug free.. i hope so 00:57:38 i'd dislike it if there are bugs in me... 00:58:42 there are bugs in my programming 00:58:43 Gregor is an undergraduate college student. 00:58:49 That's as close as you get to know :P 00:59:07 i'm un-us i don't know what a undergraduate college student is... 00:59:23 Im a graduate college program 00:59:24 First four years of college. 00:59:28 (Usu.) 00:59:39 Going for a B{S,A,M} 00:59:42 what's college? 01:00:05 University ... don't know other international words for it. 01:00:22 ah 01:00:51 (Well, actually, college != university, but they're used almost interchangeably in most scenarios) 01:01:02 generally, yes ;-) 01:01:18 * Wildhalcyon has attended both colleges and universities 01:01:38 A university is a conglomeration of colleges (at least, in the US) 01:02:15 So PSU, my university, has a college of engineering and computer science, a college of business, a college of education, etc. 01:02:40 But the terms are nowhere near that concrete :P 01:02:57 Dern you for making me realize that particular flaw in the English language :P 01:03:35 its not YOUR flaw with the language, its a flaw within the language itself 01:05:08 I claim this flaw in the name of Gregor Richards! 01:05:11 * GregorR-W puts a flag on it. 01:05:53 please give me 1000 Euro 01:06:01 It shall now be known as the Gregor Richards Ambiguity 01:06:21 hmm i think this feature isn't supported by any interpreter 01:06:29 * Wildhalcyon charges a naming consultation fee 01:13:38 So Im trying to decide how to deal with functions and threads 01:16:56 -!- Wildhalcyon has quit (Read error: 104 (Connection reset by peer)). 01:17:49 You've awakened the gazebo! It catches and eats you. 01:31:26 calculate a prime number that is larger than the largest known prime number 01:53:45 people are already spending more computing power on that than is good for them 01:54:33 i don't know what that is.. i'm feeling stupid now... http://redhanded.hobix.com/-h/hoodwinkDDayOneForcingTheHostToAttendTheParty.html 02:10:04 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 02:17:34 -!- WildHalcyon has joined. 02:19:26 Anyone have any suggestions for character sets to use besides ASCII and Unicode? Something a lil' more.. erm... esoteric? 02:21:26 ebcdic 02:22:27 it's interesting to compare ebcdic and ascii, and then look at the base64 character table. 02:24:50 Hmmm, I'll take a look 02:24:53 thanks for the suggestions 02:48:05 -!- GregorR has joined. 03:31:33 -!- calamari has joined. 03:31:46 hi 03:32:25 well, my automata class won't be covering lambda calculus.. not even mentioned in the book 03:34:19 poor calamari 03:34:31 but it doesn't belong to automata theory 03:46:17 well the class is actually about the theory of computation 03:46:29 -!- pgimeno has quit (Read error: 104 (Connection reset by peer)). 03:46:29 oh. 03:46:35 it belongs to that, yes. 03:46:45 finite automata is just a part of the class 03:47:07 finite automata are boring. hmm. let me guess, it does stack machines and turing machines, too? 03:47:25 stack machines = push down automata. 03:47:26 turing machines.. not sure about stack 03:47:36 haven't been to the first class yet 03:50:19 topics: Deterministic finite automata, Nondeterministic finite automata, Regular expressions, Nonregular languages (Pumping Lemma), Context-free grammars, Pushdown automata, Non-context-free languages, Turing machines, Decidability, Reducibility, Complexity (P/NP/NP-c) 03:50:48 so yeah.. stack machines :) 03:52:13 me bends a piece of memory into two stacks.. yay 03:52:16 heh 03:52:40 at least I assume that's what a stack machine is about 03:55:52 a pushdown automaton has only a single stack 03:55:57 -!- pgimeno has joined. 03:56:15 so it's computationally weaker than a turing machine but stronger than a finite state automaton 04:29:26 hmm. wonder if 2 queues is enough 04:30:41 seems like a circular queue would be 04:36:26 no, couldn't possibly be.. because then memory would be finite 04:40:14 hmm, queues alone don't seem like they are enough, because they'd have to be finite 04:41:33 well, maybe 04:42:46 afk.. gotta think about this some more :) 04:44:41 yeah.. seems that a stack can be emulated with 2 queues 04:45:02 so it'd take 4 queues to be tc? 04:45:27 oops 04:45:57 blah.. messed up my diagram 04:57:53 a circular queue is enough if it can grow. 04:58:01 yeah 04:58:33 which is easy using the same interface as a stack - push (on one end) and pop (from the other). 04:59:01 right... that's what I was originally thinking.. but I for some reason thought it had to be fixed size 04:59:34 I'm trying to think about 2 growing non-circular queues 05:05:04 a queue is easily made to be circular, so I guess it doesn't matter 05:08:32 it's a queue. the circularity is an implementation detail. right. 05:34:24 Time for the Unturing Test! 05:34:34 Here's how it works: 05:35:41 You declare the Unturing Test with about 10 people (staggered over time), and attach ELIZA to 5 of them. The other 5 you communicate with, trying to emulate ELIZA. If you fool any of the 5 that you did not attach ELIZA to, you are successfully Artificially Unintelligent! 05:38:44 Is it because I did not attach eliza to I am successfully artificially 05:38:44 unintelligent that you came to me? 05:47:32 lol 05:47:47 How to you feel about I did not attach eliza? 05:47:58 lol -> Can you elaborate on that? 05:48:09 How do, rather :-P 05:48:14 XD 05:48:27 stupid emacs doctor mode. 05:48:36 I wonder if you can turn MegaHAL into ELIZA... 05:51:11 good night 05:51:23 -!- int-e has quit ("Bye!"). 06:00:40 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 06:01:38 now you can update the IRP page ;) 06:02:30 -!- nooga has joined. 06:02:37 hello 06:02:40 lol 06:02:44 ? 06:02:47 hey nooga 06:02:53 hi nooga, WildHalcyon 06:02:59 Im laughing at something else, nm 06:03:25 Your talk on queues got me thinking calamari 06:03:47 glad someone is.. not sure I am tonight :) 06:04:06 You seemed to be doing alright earlier 06:04:16 Im just pondering other potential data structures that could be used 06:04:31 priority queue? 06:05:08 I thought about that, but Im not sure 06:05:44 yeah, not sure about that 06:05:59 I broke out my Data Structures book from undergrad to take a look at other options 06:06:27 hehehe 06:06:34 22:07 06:06:56 * calamari hides from WildHalcyon's B-Tree 06:07:24 you think a B-Tree is the worst up my sleeve? 06:07:49 * WildHalcyon laughs evilly 06:08:29 * nooga wonders how's tokigun going with SADOL interpreter ;> 06:09:16 right now, Im debating between a treap, a k-d tree, and a pairing heap 06:10:03 hmm... fibonacci heaps seem pretty neat too 06:10:13 o.O 06:10:48 Treaps are cool because they could be used to implement a sort of "bag" data structure 06:11:06 You can put stuff in, but every time you pull something out, its random. 06:11:49 Basically, its a stack with a push operation and a pop which pops randomly from the bag. Nice and nondeterministic 06:13:36 o.O 06:15:08 k-d looks good 06:15:49 Im not sure if it counts as being TC, because you're never GUARANTEED to get the result you want 06:15:53 Yeah, I like k-d trees 06:16:14 I was thinking a 2-d 06:32:04 what are k-d trees? 06:34:57 A way to hold two types of data and search for a combo of both 06:36:42 the rows alternate between the two types.. i.e. when deciding which goes left and which goes right underneath it 06:37:59 Right, essentially, a 2-d tree has two types, a 3-d tree has three types to search among, etc. 06:38:24 so if the types are A and B.. the root would be based on A.. so if you had (A-1,4) it'd go left, (A+1,4) goes right. But, now.. the 2nd row is based on B.. so if B>4 go right, otherwise left 06:38:40 hope that makes some kind of sense.. I have no really studied these trees :) 06:40:35 That's pretty much it. At each level of the binary tree, sort based on different types of data 06:41:47 hmm.. lets say BST bf... you'd have left/right/up 06:41:58 (keeping it simple at first) 06:43:14 but you'll also want to be able to manipulate the tree 06:43:25 insert and delete 06:45:15 hmm .. maybe an avl 06:46:34 nah.. who cares if it's balanced :) 06:56:07 hm 06:57:20 hmm, maybe it's just been too long since data structures, but it doesn't seem like trees and arrays really mix, unless it's a non-bst 06:58:12 how to say 'without any arguments' in one word? 06:58:22 argumentless ? 06:58:24 ;> 07:01:53 huh? 07:02:32 seems like there is a special word to describe that for asm intructions, but I can't think of it 07:04:13 hm 07:04:28 then i'll use 'argumentless' 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:28:10 -!- nooga_ has joined. 08:32:36 hehe 08:32:46 SADOL's homepage is almost done 08:37:32 -!- nooga_ has quit. 08:45:45 -!- nooga has quit (Read error: 110 (Connection timed out)). 08:51:08 -!- calamari has quit (Read error: 110 (Connection timed out)). 09:55:00 -!- nooga has joined. 09:55:08 hi 10:04:44 -!- jix has joined. 10:17:24 -!- nooga has quit. 11:30:05 moin 13:28:46 -!- nooga has joined. 13:29:59 hi 13:30:05 r u there tokigun? 13:33:09 -!- nooga has quit (Client Quit). 14:08:43 -!- Keymaker has joined. 14:09:08 evenin' 14:12:46 nooga: good to hear SADOL's page is almost done 14:13:00 i checked the 'pre-version' or something; seemed interesting 14:18:49 GregorR: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 14:19:18 Wow, that program took a long time to run. 14:19:23 :) 14:19:40 great language 14:21:06 Why thank you 8-D 14:24:08 :) 14:24:27 i think i'll add my Unnecessary to joke languages list 14:28:20 what is good word for 'source code'? 14:28:44 "source code" is an excellent word (OK, phrase) for "source code" :-P 14:28:51 :p 14:28:58 but any other word? 14:29:36 Hmmmmmmmmmm 14:29:52 nah, that has too many 'm's 14:30:01 If it wasn't 6:30AM here, I might be able to think of one. 14:30:21 i see. 14:30:34 well, better get to work then >:) 14:31:59 I will :-P 14:32:23 :) well, i guess i use 'program file' then 14:32:27 i don't like word 'source' 14:34:54 -!- puzzlet has quit (Read error: 110 (Connection timed out)). 14:53:45 -!- CXII has changed nick to CXI. 15:17:42 bye. 15:17:44 -!- Keymaker has quit ("I've seen this déjà vu before.."). 16:58:59 Have I left this logged in all night? 16:59:04 That's probably no good :P 17:15:36 Meh 17:29:58 -!- nooga has joined. 17:32:51 hm hehe] 17:33:09 hello] 17:36:08 moin nooga 17:36:55 -!- int-e has joined. 17:48:12 jix: i guess you're using apple computer huh? 17:49:32 OS 8.2 ? 17:52:21 -!- int-e has left (?). 18:01:46 huh? 18:05:07 nooga: mac os x 10.4 18:07:01 but i used at least one version of all mayor versions starting with 7 (7.x,8.x,9.x,10.0.x,10.1.x,10.2.x,10.3.x,10.4.x) 18:07:16 nooga: why do you ask? 18:07:30 hm 18:07:38 ist's kinda exotic 18:07:56 once i even wanted to buy a Mac Mini 18:08:30 it has poor graphic performance 18:08:54 to get all the osx eye-candy you need a better graphic card than the one of the mini 18:09:32 the mini graphic card has no core-image acceleration support 18:10:19 i thought that the mini has got radeon 9200 18:10:42 hmm radeon 9200 is maybe too old for core-image acceleration 18:12:23 core image makes intensive use of fragment-shaders (the basic effects of the UI don't use them but the dashboard widget drop effect does) 18:15:51 heh 18:16:04 i've got nVidia gf4 MX 440 in my PC ;p 18:16:15 hmm is that good? 18:17:18 nope 18:18:14 do you know that drop-in effect? 18:18:19 from dashboard 18:18:55 no 18:19:29 i made a video (mpeg 4) it's a bit slow because of screen recording 18:19:31 http://rapidshare.de/files/4292460/dropin.mp4.html 18:19:38 click on free and the download should start... 18:20:50 you have to wait a few seconds.. 18:25:23 nooga: ? 18:25:39 I've got an Nvidia GeForce 2. 18:25:41 Works great. 18:25:59 GregorR: my old gf2mx worked great too 18:26:07 i just missed this drop-in effect 18:26:48 and 80% of the quartz-composer effects (a developer tool for effect composition but i don't know any app that uses this) 18:27:28 hm 18:27:30 and i can play games on higher resolutions now...(ati radeon 9800pro) *g* 18:27:37 excuse me 18:28:11 http://pastebin.ca/20877 18:28:14 Megahal = smart. 18:29:19 hehe 18:29:25 i can't open mp4 18:29:43 nooga: do you have quicktime? 18:30:01 version 6 or newer? 18:30:10 older ;p 18:30:18 video lan client works too 18:31:58 You people and your visual effects. 18:32:14 GregorR-W: *g* 18:32:23 How could that effect possibly be useful :P 18:32:43 GregorR-W: there is a simple answer... 18:33:00 hyh 18:33:07 GregorR-W: it wasn't meant to be useful.. it was meant to make windows user think "WOW LOL OMG! I want to have THAT!" 18:33:10 i run windows without any effects :> 18:33:22 i've got XP, but it looks like nt 4 :p 18:33:36 Make it look like NT3! 18:33:39 NT3 rawx0rz! 18:33:43 ehehe 18:33:52 but that's true 18:34:05 MacOS X looks eyecandy 18:34:15 i have no problem with the effects because mac os x uses hw accelerated blitting for everything.. makes no difference if there is an alpha channel or not... 18:34:23 i helped to develop SenseOS 18:35:00 we wanted to make OpenGL GUI and make it look even better than MAcOS X ;p 18:35:11 but the project has died 18:35:22 but someday i take 20 arm or ppc or custom processors and build my own computer with my own os ... 18:35:48 currently we have GUI on VESA with complete API that looks exactly like BeAPI 18:35:57 and some ports from unix 18:36:13 i don't know polish... can't read that... 18:37:04 coreutils, binutils, makeutils, gcc, perl, bash, nano, mc, irssi, elinks etc etc. 18:37:15 jix? what polish? 18:37:26 nooga: i googled for SenseOS 18:37:40 ah, it's completely dead 18:37:48 it has font anti-alliasing 18:37:49 maybe i've got some screens 18:37:59 huh? 18:38:00 i've got some... 18:38:11 http://agentj.risp.pl/?Projekty:SenseOS:Screenshoty 18:38:25 /away 18:38:45 a 18:38:48 hmh 18:38:57 and freetype support ;p 18:42:12 but it's f*in dead 18:42:17 ...for some time 19:00:49 -!- GregorR-W has left (?). 19:17:06 hyh 19:17:08 http://nooga.int.pl/sadol/index.php 19:33:56 tokigun 19:34:01 pleeez say something 19:38:33 say that you finished it ! 21:09:14 heh 21:28:05 -!- {^Raven^} has quit (Read error: 110 (Connection timed out)). 21:28:59 -!- {^Raven^} has joined. 21:41:51 -!- WildHalcyon has quit (Read error: 104 (Connection reset by peer)). 21:53:47 -!- jix has quit (Read error: 104 (Connection reset by peer)). 21:55:20 -!- jix has joined. 22:09:53 hi jix 22:13:55 -!- WildHalcyon has joined. 22:16:29 be careful with recursive forks 22:16:37 o.O 22:16:38 As Ive mentioned more than is good for me, I'm creating a Funge-derivative which uses separate topological spaces for different functions, and each is given a label 22:16:49 /away 22:17:32 Im trying to think of a way in which to assign a cell to multiple function spaces simultaneously 22:20:19 (reading the SNUSP spec again) Is it just me, or is there something... enchanting... about seeing the f-bomb dropped in what looks like an academic paper? 22:33:58 hehe 22:41:53 people should learn to use pdf(la)?tex 22:42:52 those =>dvi=>pdf things have no pdf specific features like links in the Contents and arn't nice on the screen 22:42:55 hyh 22:43:02 =>dvi=>ps=>pdf is even worse... 22:44:17 huh 22:45:02 nooga: ? 22:45:41 that is no fun! 22:46:32 this snusp sepc pdf is really fucked up 22:46:32 allrigh allrigh 22:46:53 i select text.. copy it... and get %/]||]01}â€œÂ¶}â‰ Â¶|Â¢ alike things... 22:51:33 made my own pdf out of the textfile 22:52:09 -z 22:52:10 -t 22:52:16 -'-z' 22:52:17 arg 22:52:20 wanna see a funny pic ;p ? 22:52:37 -!- calamari has joined. 22:53:44 look, o'reilly has released a book about SADOL: http://nooga.int.pl/sadol/sadol.jpg 22:54:18 harhar 22:54:33 ;] 22:56:20 gn8 22:56:27 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 22:56:28 well, definitely to lambda calculus.. asked hte instructor and he said No :) 22:56:32 to->no 23:10:14 heh 23:10:38 * nooga likes manipulations with photoshop :> 23:13:27 Jix, whats this about pdf(la)?tex ??? 23:13:32 ack... nm, he left 23:13:52 fyi nooga, the word you're looking for is "painful" 23:17:44 a 23:17:46 ;> 23:26:51 -!- nx5_off has joined. 23:27:20 -!- nx5_off has changed nick to nx5. 23:27:20 huh 23:27:55 WildHalcyon: but say, you like that cover 23:28:21 nooga: ever find a better word than argumentless ? 23:28:57 huh? 23:29:08 maybe that wasn't you.. sorry :) 23:29:20 that was me 23:29:39 ahh ok.. 23:29:40 i just wrote 'argumentless' 23:29:41 ;> 23:29:45 need food cya 23:29:47 -!- calamari has quit ("Leaving"). 23:29:53 oh 23:35:58 Nooga, its alright... the fact that half the girl's head is cut off bothers me a bit 23:36:00 but thats cool 23:36:26 i tried to find other 23:37:25 but that one was the best: http://images.google.com/images?client=firefox-a&rls=org.mozilla%3Apl-PL%3Aofficial_s&q=dominatrix&hl=pl&btnG=Szukaj+obraz%C3%B3w ;p 23:45:37 Hmm.. yes, I can see 23:45:46 ;p 23:45:55 There was no way to reposition her on the cover though? 23:46:09 yea 23:49:05 hmmm 23:57:34 hehe 23:57:38 what a stupid joke 23:57:52 making false book covers :>