01:19:57 -!- Sukoshi has joined. 01:45:26 -!- Sgeo has joined. 01:51:19 -!- lament has changed nick to lament3. 02:46:46 -!- SevenInchBread has joined. 02:55:44 -!- ShadowHntr has quit (Client Quit). 02:57:36 -!- Lunaris has joined. 02:57:53 http://www.geocities.com/dark_mage60/home.html - Donate to my site please ;) 02:58:10 -!- Lunaris has left (?). 03:09:23 -!- Figs has joined. 03:09:31 hey 03:09:51 you guys should make a 'h4x0r' asm where 'omg' 'wtf' 'rofl' and 'pr0n' are opcodes :P 03:10:07 mneumonics* 03:10:30 *mnemonics 03:11:21 have you looked at Omgrofl? 03:11:27 no 03:11:31 already been done? :P 03:11:42 but of course 03:11:50 heh heh heh @.@ 03:17:01 what is tldr? 03:17:09 talk later? 03:17:18 ta ladder? 03:17:41 too long; didn't read 03:17:47 oh 03:18:13 GIYF 03:18:28 GIFY? 03:18:45 google is your friend 03:18:51 no it isn't 03:18:52 :P 03:19:06 http://www.google.com/search?q=define%3Agify&start=0&ie=utf-8&oe=utf-8&client=firefox-a&rls=org.mozilla:en-US:official 03:19:08 well that's where i found tldr anyhow 03:19:20 http://www.google.com/search?q=define%3Atldr&start=0&ie=utf-8&oe=utf-8&client=firefox-a&rls=org.mozilla:en-US:official 03:19:25 it suggested ntldr 03:19:29 NT loader O.o 03:19:40 maybe I'm just being too smart 03:19:46 and should have just searched more directly... 03:20:10 indeed, because wiktionary came up on top 03:20:15 eh 03:20:17 :P 03:20:20 WIYF too of course 03:20:29 wikitionary is your friend? 03:20:33 or wikipedia 03:20:34 ? 03:20:36 both 03:20:41 wiki -X is your friend 03:20:44 WXIYF 03:20:56 WTFC2P 03:21:41 can I call operations without a variable in OMGROFL? 03:21:43 like, 03:21:44 what is wiki -X? google is not particularly friendly on that 03:21:45 l33t 03:22:00 instead of l33t lol 03:22:01 ? 03:22:11 wiki(fill in the blank) 03:22:13 I meant 03:22:47 like -ed -ing 03:22:51 suffix 03:22:56 -X 03:23:06 wiki -tionary, -pedia 03:24:18 i don't think you can leave out variables 03:24:27 shoot 03:26:00 although there is no real reason why not 03:26:26 so like, 03:26:29 rtfm 03:27:08 haxor 03:28:41 wtf lol iz leik 0 03:28:45 tldr 03:28:46 brb 03:28:48 brb 03:29:05 .... oops 03:29:54 is this right? --> s/brb/brb\nlmao lol 03:35:38 it's not a whole program 03:35:55 yeah 03:35:58 I didn't define lol 03:36:10 and leik=like 03:36:24 ... yeah? 03:36:29 wait 03:36:33 wtf lol iz leik 0 is a comparison 03:36:34 =liek 03:37:07 i should know this since i actually cleaned up that page 03:37:15 ;) 03:37:28 does x86 have a page? 03:37:31 it really should 03:37:48 not on our wiki i presume 03:37:59 too bad :P 03:38:16 it's not esoteric 03:38:30 it just seems like it to me :P 03:38:42 intention matters quite a bit 03:39:14 yeah 03:41:00 on the other hand, it seems to only be used by a relatively small subset of programmers 03:41:39 which seems to match at least one definition of I've read of esoteric 03:41:57 'limited to a small circle' (ex. esoteric persuits) 03:42:12 but I could be misunderstanding that meaning :P 03:42:42 by that definition most programming languages would be esoteric 03:42:47 :P 03:43:05 most people consider programming in general to be esoteric :P 03:43:31 but I meant within the context of programming :) 03:43:45 namespace Programming {};//rofl 03:43:51 but eh 03:44:14 whatever. 03:44:24 I'm just lazy :) 03:44:48 well, x86 assembler might be in the top 100, and there are thousands of languages 03:44:54 mmm 03:44:56 :P 03:45:09 ok. I see your point 03:45:28 i wonder where to check that... 03:45:53 * Figs starts searching for the instruction set for UNIVAC 03:50:18 http://www.fourmilab.ch/documents/univac/instructions.html 03:51:43 Imagine programming for that thing O.o 04:13:12 Giant instruction sets are awesome. :) 04:14:46 Z80? 04:15:03 252 out of 256 single-byte op codes :P 04:15:12 damn :P 04:19:22 pfft. 04:19:38 I want every possible permutation of two bytes... 04:19:50 with the other 4 enabling extended ops :P 04:19:58 ....oh 04:20:07 ACCEPTABLE 04:20:08 i guess. 04:20:10 :P 04:21:56 http://en.wikipedia.org/wiki/Z80#Instruction_set_and_encoding 04:22:08 oh sorry 04:22:16 "extensively as opcode prefixes" 04:22:18 my mistake 04:22:24 only two enable extra instructions 04:22:41 the other two do something else that I don't understand :P 04:26:50 ...I wish I had my own assembly lang... 04:27:02 or rather... my own computer architecture. :) 04:27:07 make one 04:27:12 * SevenInchBread would make an awesome computer. :) 04:27:54 FOUR BILLION INSTRUCTIONS... 125-bit integers... 04:27:57 might I recommend playing with xLogicCircuits? 04:28:06 HARDWARE SUPPORT FOR LINKED LIST OPERATIONS. 04:28:10 Slow as molasses :) 04:28:12 wassat? 04:28:26 xLogicCircuits is a program for designing... logic circuits :P 04:28:30 it's a java app 04:28:33 meant for teaching 04:28:35 GIFY 04:28:42 ...I bet it sucks. 04:28:52 I made most of a 4-bit CPU in it 04:29:11 and then I my browser crashed and I forgot to save 04:29:12 :| 04:29:22 got bored trying to rewrite the stack :P 04:29:41 Fuck RISC - computer architectures need to add more crap and be extremly confangled. 04:29:46 * SevenInchBread likes confusing and elaborate things. 04:30:04 rofl, I kind of like RISC after looking at x86 and going 'wtf?' 04:30:18 but eh 04:30:50 I actually pulled out my hex editor and started working out what the binary in the instructions meant... 04:31:39 I got a fair ways, too 04:33:35 is SI a general use register? 04:34:28 7", I take it you don't like the "subtract and branch if negative" view of computing? 04:35:55 ...I don't really understand how it works. 04:36:03 me neither :P 04:36:27 ...what does "branch" mean? 04:36:50 I suppose if(x) {a();} else {b();} would be a branch 04:36:59 jmp? 04:37:30 Figs: see 1337 04:37:39 branch = choice 04:37:58 *branching 04:38:01 OISC is the shit 04:38:09 I wrote a subleq vm once 04:38:16 it was fun to play with 04:51:30 what is the x86 equivalent of ax << 1 04:51:31 ? 04:51:36 (multiply by 2) 04:52:07 shl cx? 04:52:11 *ax 04:59:46 what the hell 04:59:51 I get GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG 04:59:53 O.O 05:06:30 ok 05:06:31 now I get 05:06:33 HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH 05:06:40 which is more reasonable :) 05:06:44 but still WRONG 05:06:45 :P 05:09:40 -!- ShadowHntr has joined. 05:40:30 I like OISC and think it would be nifty, especially since memory is the only bottleneck. 05:41:09 what do you mean, it would be? 05:41:41 hey 05:41:45 question for asm guys 05:41:48 if I do 05:41:51 mov bp,[bp] 05:41:54 will it fuck up? 05:42:06 and also 05:42:08 if I call 05:42:09 ret 05:42:11 no, it will fuck down 05:42:28 it will pop a word from the stack, right? 05:43:30 I don't know x86 asm, but i would imagine 05:52:50 Well, g'night all 05:54:11 -!- Sgeo has quit ("Leaving"). 06:05:39 g'night 06:10:44 -!- oerjan has quit ("Gooed knight"). 06:24:18 eye donut think "Gooed" is a word 07:20:47 -!- Figs has quit (Read error: 110 (Connection timed out)). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:08:57 -!- ShadowHntr has quit (Read error: 110 (Connection timed out)). 08:46:59 -!- ShadowHntr has joined. 09:06:38 -!- ShadowHntr has quit ("End of line."). 09:23:15 -!- sebbu has joined. 11:36:44 -!- jix__ has joined. 12:03:29 -!- nazgjunk has quit ("restarting xchat"). 12:04:15 -!- nazgjunk has joined. 12:05:02 -!- nazgjunk has quit (Client Quit). 12:05:31 -!- nazgjunk has joined. 12:25:06 -!- sebbu has quit ("reboot"). 12:34:58 -!- oklopol has quit (Read error: 145 (Connection timed out)). 12:43:36 -!- sebbu has joined. 13:37:24 -!- nazgjunk has quit ("reboot"). 13:43:48 -!- nazgjunk has joined. 13:53:22 -!- sebbu has quit ("Leaving"). 14:16:22 -!- helios24 has quit ("leaving"). 14:16:30 -!- helios24 has joined. 14:23:52 -!- sebbu has joined. 14:30:55 -!- UpTheDownstair has joined. 14:31:01 -!- UpTheDownstair has quit (Read error: 104 (Connection reset by peer)). 14:50:39 -!- nazgjunk has quit (Remote closed the connection). 14:54:36 -!- nazgjunk has joined. 15:33:09 -!- SevenInchBread has quit ("haaaaaaaaaa"). 15:59:09 -!- jupiter3888 has joined. 16:12:35 -!- jupiter3888 has quit. 16:13:24 -!- ais523 has joined. 16:23:29 -!- jix__ has quit (Read error: 104 (Connection reset by peer)). 16:25:13 -!- jix__ has joined. 16:27:13 -!- nazgjunk has quit (Remote closed the connection). 16:30:09 !ps d 16:30:11 1 EgoBot: daemon ul reload 16:30:13 2 EgoBot: daemon deadfish reload 16:30:15 3 EgoBot: daemon irp reload 16:30:17 4 EgoBot: daemon dog reload 16:30:19 5 ais523: ps 16:30:40 !ul (so this is still working, then?)S 16:30:43 so this is still working, then? 16:31:08 !undaemon irp 16:31:11 Process 3 killed. 16:44:26 -!- nazgjunk has joined. 16:56:51 !help 16:56:53 help ps kill i eof flush show ls bf_txtgen usertrig daemon undaemon 16:56:55 1l 2l adjust axo bch bf{8,[16],32,64} funge93 fyb fybs glass glypho kipple lambda lazyk linguine malbolge pbrain qbf rail rhotor sadol sceql trigger udage01 unlambda whirl 17:08:42 -!- calamari has joined. 17:13:17 -!- SevenInchBread has joined. 17:13:50 >.> 17:16:34 SevenInchBread: ? 17:25:08 -!- SevenInchBread has changed nick to CakeProphet. 17:53:38 -!- oerjan has joined. 17:54:15 -!- Figs has joined. 17:59:45 but "gooed" _must_ be a word, even if not in the dictionary. After all it has obvious meaning. 18:00:05 at least two of them, i think. 18:00:54 hi 18:01:00 hi figs 18:20:33 hi everyone 18:21:24 hi 18:22:58 This conversation is getting redundant quickly 18:25:16 :P 18:25:57 hi!! 18:27:13 looking forward to tomorrow, anyone? 18:27:23 (or I suppose today in some timezones) 18:27:51 ;p 18:34:09 why would i ? 18:34:13 well, yeah, i am 18:37:59 I might even make a special attempt to obtain Internet access tomorrow. 18:38:15 (The fact that I have Internet access today is due to the fact that I need to prepare.) 18:42:43 :P 18:42:48 what are you doing? :P 18:43:19 -!- calamari has quit (Remote closed the connection). 18:44:38 I was sending some new esolang files to graue so he could put them on the archive, and I could let everyone know about them tommorow 18:44:42 ....what's tomorrow? 18:44:42 *tomorrow 18:45:03 CakeProphet... look at a calendar 18:45:13 CakeProphet: the anniversary of the release of Whitespace 18:45:17 *sigh* 18:49:57 .... 18:50:33 whooo... 18:50:39 your output string ended with the first ., because NUL is an end-of-string marker in many programming languages, so the remaining 3 are redundant 18:50:57 ... 18:54:05 omote prepares the mysterious ointment... for overview of ais523's constituents. 18:54:15 * CakeProphet prepares the mysterious ointment... for overview of ais523's constituents. 18:54:16 :) 18:56:10 * ais523 wonders how they became an MP without realising it 18:56:22 MP? 18:56:55 In England, an MP (member of Parliament) is in charge of one constituency, and everyone living there is their constituent 18:56:59 -!- oklopol has joined. 18:58:04 ...I have this strange feeling that ais523 is some kind of robot. 18:59:29 ?bf ,[.,]!testing 18:59:31 testing 19:00:41 rofl 19:06:31 ais523: *where* in England? 19:06:50 I'm not an MP, as far as I know 19:07:04 unless I misunderstand you 19:07:12 besides, if you really want to know, a whois will tell you 19:09:10 birmingham? 19:09:26 or near there 19:09:34 at the moment 19:10:58 I am in durham during term-time 19:11:00 but not now 19:17:39 ais523 i think CakeProphet meant the no-gender thing 19:18:13 I don't see why a gender is important in online communication 19:18:21 -!- dog4 has joined. 19:18:36 hola 19:18:45 * CakeProphet usually doesn't disclose his gender... althought it's probably obvious. 19:19:04 :) 19:19:41 hello everyone I haven't said hello to yet 19:19:59 not just people in #esoteric, /everyone/ 19:20:11 (although they're less likely to get the message) 19:20:41 just tell them to turn up their telepathic receivers to 11 19:21:24 we seem to have a record number of people here whose screennames end in numbers now 19:21:38 I don't think I've seen as many as 5 before 19:21:42 -!- Figs has changed nick to Figs42. 19:21:43 :P 19:21:43 -!- Figs42 has changed nick to Figs. 19:22:00 why the fsck is my program not working STILL? :( 19:22:06 which program? 19:22:52 x86 asm .COM program to take any set of address to null-terminated strings and print them to the console 19:23:02 and then clean up inside the function 19:23:16 (like stdcall instead of regular cdecl) 19:23:47 I was working on an interesting variant of .COM programs a while ago 19:24:03 If you want to send someone a program over Usenet, one way is by uuencoding it 19:24:21 but if they're using an outmoded operating system like Windows, they won't necessarily be able to un-uuencode it 19:24:31 so I came up with the idea of self-extracting uuencode 19:24:53 (or to be precise, I saw it mentioned elsewhere and liked the idea) 19:24:57 ;) 19:26:10 you mean like a COM/EXE UUENCODE polyglot? 19:26:10 ais523: :-! 19:26:10 O_O 19:26:12 omg 19:26:17 I think I figured it out 19:26:34 I'm pushing the value of BP that I popped 19:26:38 well, theoretically the UUE data does not start until the "begin" line, so... 19:26:39 http://pastebin.ca/raw/418585 19:27:04 is the program itself (in a self-uudecoding format, written in obfuscated C) 19:27:11 which is where SP was before... 19:27:31 except that my version uses 2 bytes per byte, rather than 1.33, so is less efficient 19:27:39 and it doesn't contain any newlines, because newlines are nonportable 19:28:11 oerjan: a COM/UUENCODE polyglot would be even better, if it could be managed somehow 19:28:23 -!- atrapado has joined. 19:28:59 hmm 19:29:44 'begin' doesn't disassemble into anything, unfortunately, because lowercase letters don't correspond to anything AFAIK 19:29:46 does anyone have an x86 simulator so I can see what my program is doing? 19:29:57 simple, you have a COM file that starts with the decoder, followed by a newline, then the usual UUE format. 19:30:12 Figs: GIYF 19:30:26 Figs: on Windows/DOS, you can use the DEBUG program to single-step through a COM file 19:30:37 no 19:30:44 ... hold on 19:31:18 how do I get the values of the registers? 19:31:46 In DEBUG, ? lists all the commands available 19:31:53 yeah, I'm looking at that 19:31:57 and I've looked at it before 19:31:59 I'm pretty sure there's one to get/set registers, but I can't check it at the moment 19:32:47 o.o 19:32:51 maybe there is 19:32:57 I'm not sure 19:32:59 -!- ais523 has quit ("somehow it reached half past seven without me noticing. Clock changes are annoying"). 19:33:12 I really hate debug, to be honest... it's help is next to useless 19:33:45 it's *traditional* 19:33:53 :p 19:35:13 like ed 20:01:05 hmmmm 20:01:08 I SAU 20:01:10 SAY 20:01:23 ....well.... 20:01:24 No. You sautee. 20:01:31 -!- Figs has left (?). 20:08:28 Lessee.... 20:13:22 -!- calamari has joined. 21:15:23 calamari: what? 21:19:59 3-- 21:20:22 ITYM LET 3 = 3 - 1 21:20:42 3 is not a valid lhs 21:20:52 depends on the languge 21:21:09 It could be done in some Fortran compilers that targetted machines without immediate constants 21:21:22 every constant had to be somwhere in memory 21:21:34 makes sense 21:21:35 and there was little checking 21:21:49 and identical constants would be shared, so... 21:22:07 a constant was like an initialised variable 21:22:58 random poll: minesweeper records :) 21:23:31 I was killed in a mine collapse once 21:23:43 on windows standard sizes, i have 7, 60 and 192 21:23:49 i'm so hooked 21:24:37 hm... i have a vague idea that i was better than that in my time 21:24:51 :< 21:24:53 feckz 21:25:02 i need a better mouse... 21:25:03 :) 21:25:06 i am sure i was below 150 21:25:12 yeah, the big one... 21:25:24 I hate my interenets 21:25:31 800 ms ping times 21:25:37 25% packet loss 21:25:37 i get goddamn slow when it's almost done 21:25:54 nowadays my hands cannot cope with it :( 21:27:31 ....I have a... hacker impulse. 21:28:13 i made a minesweeper once that had nice keyboard shortcuts... the problem is it did board refreshing by printing it again with stdout... looked ugly.. and i didn't know how you can read input without the user having to press return 21:28:34 i still don't though, if you wanna use console 21:29:03 Like, a few days ago I considered hijacking ICANN's traffic so I could redo the entire domain name structure of the internet 21:29:19 so it wasn't all...... business-ized. 21:30:39 oklopol , maybe using ncurses 21:30:59 CakeProphet: gov.us now wants ICANN to hand over the master key for DNS signing (see slashdot for more) 21:31:12 ..................................... 21:31:16 ........................................... 21:31:32 alright - I'm tempted to do something radical. 21:31:52 I SHALL FORM A GROUP... A BAND OF CONSPIRACY PIRATES... TO ENSURE THAT NO ONE OWNS ANY PART OF THE INTERNET. 21:32:51 the esoteric socialist brothers 21:33:18 ICANN needs a standing army 21:34:39 icann we don't need 21:34:49 anarchy on the internets! 21:35:09 -!- atrapado has quit ("ribadeo"). 21:36:16 yep... anarchy! 21:36:43 anarchy in america! 21:37:14 * bsmntbombdood revolves 21:37:15 thre really shouldn't be any regultation of domain names other than being globally consistent and first-come-first-serve. 21:37:50 being a business shouldn't make you more entitled to having a name. 21:38:16 erm 21:38:21 that would enable spoofing 21:38:52 In the sense of people setting up a site with the company's name that looks like an official site 21:38:58 actually... 21:39:14 -shrug- fuck businesses. :) 21:39:35 I wonder why none of these phishing websites just act like a web proxy but with MITM on the secure stuff? 21:41:51 they do 21:42:07 they can usually not fake the sertificates, which are tied to the exact domain name, i think 21:42:48 oerjan really, expert under 150 :O feck i have some work to do... 21:44:34 i vaguely recall something around 129. 21:46:26 hehe you just robbed me of a few nights of sleep :P 21:46:54 oh dear. 21:49:45 what did you have in the small one? 21:50:09 it's much more about luck so i might stand a chance :) 21:50:18 * SimonRC finds an article from Jan 2001 that predicted Bush would start at least one war. 21:50:21 http://www.theonion.com/content/node/28784 21:52:37 um, i don't think the onion are usually trying to be accurate 21:53:50 oklopol: i don't remember at all. 21:54:10 but it is accurate 21:56:35 You aren't even allowed to leave the us without the goverment's permission anymore 21:58:31 eh, it is not midnight yet 21:59:15 feck, forgot to type up my stuff for this AFJ 22:10:40 american fuel juice? 22:10:50 -!- Figs has joined. 22:10:52 hey 22:10:55 it works !!! O_O 22:10:56 http://rafb.net/p/y5eay298.html 22:11:23 0mg 7ha7 r0x my s0x 22:11:30 Figs what's that do? 22:11:40 an advanced hello world? 22:11:43 sort of 22:11:49 Hello World. 22:11:54 Goodbye World 22:11:55 type thing 22:12:01 it prints: 22:12:04 Hello, World. 22:12:09 Goodbye, World. 22:12:13 IT WORKS!!! 22:12:33 that's very... impressive 22:12:39 the idea was to write a function that takes any number of arguments 22:12:44 and cleans itself up 22:12:59 just push the number of args last... 22:13:09 yes 22:13:12 that's what I did 22:14:54 you have to remember I am a complete n00b at asm 22:15:03 so making this work is a big achievement for me 22:15:25 I should learn a real assembly language 22:15:30 :P 22:16:35 I finally did figure out how to get debug to do what I wanted 22:17:20 my test code is rather dirty 22:18:52 -!- sebbu2 has joined. 22:18:52 it's terrible how string comparisons are O(n) 22:19:40 only if they're the same! 22:19:45 oh 22:19:47 hmm 22:19:48 :) 22:20:27 :P 22:20:44 O(n) where n is the number of chars the same 22:20:53 yeah, truez 22:21:19 i suppose that's part of why lisp has symbols 22:21:42 but it's O(logn) if most strings are different... though i'm most probably wrong 22:21:57 i mean 22:22:17 where n is the number of chars in the shorter str 22:22:29 eh, forget that :) 22:22:31 isn't the operation based on the slowest possible case? 22:22:45 oklopol: no 22:22:45 yep, so it's O(n) regardless. 22:22:47 O(n) or better 22:22:49 i think O is average 22:23:00 usually worst case. 22:23:06 well, okay, but quicksort is O(n^2) then 22:23:42 but O() doesn't really say anything about worst or average 22:23:52 wait... which is better, O(k^n) or O(n^k)? 22:23:55 (typically) 22:24:02 n^k 22:24:10 i think :) 22:24:25 yep, k^n is exponential 22:24:42 what's n^k? polynomial? 22:24:51 * Figs is not big on Big-O 22:24:59 potentual (:D) 22:25:04 The derivative is also exponential, assuming n > 2. 22:25:06 anyhow even with average case it will be O(n) unless the fraction of strings that are equal goes to zero. 22:25:39 :P 22:25:51 n^k is polynomial yes 22:25:58 thanks 22:26:27 wait 22:26:32 is ml on xp? 22:26:38 huh? 22:26:44 mmm nope 22:26:54 no parse 22:27:31 it's ok 22:27:42 I'm reading old tutorials 22:27:46 "ml on xp"? 22:27:50 probably circa 1995 22:29:28 XP meaning the number of the beast, no? 22:29:47 Microsoft Windows XP... yes 22:29:55 afk 22:29:55 dinner 22:30:46 XP looks like a smily. It can't be the name of an OS, can it ? 22:31:15 but what is ml? 22:31:32 the language? 22:31:37 SML? 22:31:44 Ocaml? 22:31:54 i am pretty sure both are available. 22:31:59 not to mention F# 22:32:05 Uggh. F#. 22:32:09 Does anyone actually use F# ? 22:32:23 probably 22:33:59 okay, i made 1000 tests with length 50 strings, 1.371 was the average number of single character comparisons 22:34:06 though 22:34:13 i might have done something wrong :) 22:34:46 well, only 1/28 require > 1 comparisons 22:34:52 i had 50 different strings 22:35:04 it depends greatly on where the strings come from. 22:35:14 what do you mean? 22:35:28 if you are comparing two random strings, then it will be something like O(log n) 22:36:07 but if you are comparing two strings that might actually be from the same source, it will be O(n). 22:36:32 hmm 22:36:40 i'll do it with 5 different strings 22:37:02 5.7 tries, length 50 strings 22:37:07 much worse 22:37:27 oh 22:37:28 actually 22:37:38 that's kinda obvious xD 22:37:45 indeed 22:38:13 but, well, any excuse to write a program :) 22:43:55 ~bf +++++++++++++++++++++++++++++++++++++++++++++++++. 22:43:56 1 22:44:32 !ul (Just checked whether i still was here)S 22:44:33 Just checked whether i still was here 22:44:58 hmmm.... 22:45:06 * CakeProphet is pondering COMPUTER ARCHITECTURES loudly. 22:45:54 -!- sebbu has quit (Connection timed out). 22:47:45 ...what's the difference between a register and a stack, exactly? 22:48:17 * oerjan boggles his mind 22:48:28 -!- Figs has quit (Read error: 110 (Connection timed out)). 22:48:39 like that a register holds only _one_ value? 22:49:25 As far as I know... a register is just a block that you stuff something in. 22:50:10 a stack is a stack of registers 22:50:28 a register holds one word 22:53:38 ah okay... a register is basically... a single unit of information. 22:53:41 not a collection. 22:55:02 oh man 23:06:09 ? 23:06:32 um. 23:06:44 CakeProphet: a _register_ is a hardware term. 23:06:48 it is not a data structure. 23:07:03 -nod- yes I know. 23:07:19 registers are named places where CPU stores values. 23:07:20 * CakeProphet suddenly feels like he's being cornered for something nasty he said. :/ 23:07:59 I was just confused over whether a register was intended for holding multiple units of information or just one. 23:08:29 when I imagine a register I imagine a big jar of data that you can fetch stuff from... but now I realize it's singular. 23:09:49 -!- Figs has joined. 23:13:30 -!- jix__ has changed nick to jix. 23:14:24 B is cool 23:14:30 no types ftw! 23:14:58 duck typing, or implicit typing? 23:15:44 B has one type, a single machine word 23:15:45 crash typing 23:16:10 yay asm... 23:16:20 data and instructions are the same thing! 23:16:28 :P 23:16:41 it'd be funny to take a program and use the code to build output messages 23:17:03 obfuscation, ftw 23:20:35 hmmm... it's a shame that instruction jumps take less effort than modifying the program... in assembly. 23:20:51 ooh 23:20:57 ...at least - with my shoddy conceptualization of a comptuer 23:20:59 you should look at the Synthesis Kernel :) 23:21:08 I HAVE PONDERED DOING SO 23:21:20 Cake, are you 7"B? 23:21:26 YEP 23:21:45 I didn't put 2 and 5 together to get Cake. :| 23:21:58 * Figs adds 6 and 1... cake? 23:22:13 hmmm... well, I guess it depends on how you build the computer which one goes quicker... 23:30:27 i was reading the synthesis kernel paper 23:33:30 -!- CakeProphet has quit (Read error: 104 (Connection reset by peer)). 23:33:51 -!- CakeProphet has joined. 23:38:13 -!- nazgjunk has quit ("Bi-la Kaifa"). 23:54:32 hi 23:54:40 I am bored. 23:55:30 Go outside and hope enough charge accumulates in the clouds to exceed the dielectric capacity of air. 23:58:06 oooh 23:58:22 a machine where the only storage is a single natural number 23:58:30 Myself, I would not lightly assume that death cures boredom. 23:59:40 You never know.