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