00:07:32 -!- ihope_ has joined. 00:08:11 Hi RedDak, bsmntbom1dood, oerjan, importantshock, and PancakeHouse.. 00:08:20 What's up? 00:08:38 Just saying hi while ignoring the timestamps completely :/ 00:08:59 I'M HERE TOO :< 00:09:18 ihope: :) 00:15:14 -!- bsmntbombdood has quit. 00:15:30 -!- bsmntbom1dood has changed nick to bsmntbombdood. 00:16:01 -!- ihope has quit (Read error: 110 (Connection timed out)). 00:39:51 -!- RedDak has quit (Remote closed the connection). 01:10:11 -!- sebbu2 has quit ("@+"). 01:31:08 Gasp! Who smiled at me? 01:33:20 ME 01:41:34 eeeew 01:41:54 haha 01:42:14 * bsmntbombdood molests ihope_ 01:42:24 ehird`: Any progress on pebble.pebble? 01:42:28 pikhq: nope =( 01:42:30 soon, soon 01:44:16 i'm going now 01:44:16 bye 01:44:43 this song goes duh duh duh, duh duh duh duh duh duh 01:45:05 with some trumpets! 01:45:23 i bet you can't guess what it is 01:45:50 Ritorna Vincitor from Aida? 01:46:12 ha ha i win 01:47:56 -!- ehird` has quit (Read error: 104 (Connection reset by peer)). 01:58:06 pikhq: I am extremely curious to see how the self-hosting pebble implementation fares 01:59:03 As am I. 02:01:33 it's gonna be hella big 02:04:59 yeah, no shit 02:05:09 this is more complex than lostkingdom. 02:05:25 I'd hazard a loose guess somewhere around 6mb of BF code 02:05:33 probably more when it bootstraps itself 02:05:48 Although I find that PEBBLE code manages to be a bit more efficient than BFBASIC. . . 02:06:02 (lower level, though) 02:06:17 6mb, lol 02:06:40 lostking is about 2.4mb, if I recall 02:06:51 what is that? 02:08:22 a text adventure game written in calamari's astounding BFBASIC 02:08:36 link 02:09:37 http://jonripley.com/i-fiction/games/LostKingdomBF.html 02:11:26 It inspired my little bit of a game in PEBBLE. 02:11:41 My engine kicks ass, but my game lacks. . . Anything. :p 02:13:46 if you want some help coming up with an actual story or something, I might be able to help 02:15:10 I may desire that some time when I have time. . . 02:15:30 Perhaps Christmas break, or Thanksgiving break, would be a good time to write & implement that. 02:15:56 i get like 12 days for thanksgiving! 02:16:24 I'll brainstorm some stuff over thanksgiving, but as a general policy I don't connect to the internet while I'm on vacation 02:16:44 I generally code something amazing in my self-induced isolation 03:00:18 -!- cpressey has joined. 03:00:37 * pikhq votes for scaring the hell out of cpressey 03:00:54 * oerjan refuses to scare a Great One 03:01:09 cpressey == Great One? 03:01:13 Proof, please. 03:01:38 http://catseye.tc/cpressey/languages.html 03:01:44 *Oh*. 03:01:59 * pikhq bows humbly 03:02:39 * pikhq makes the bow deeper. . . 03:02:42 ALPACA. :) 03:03:51 hm, ALPACA is not mentioned on the Chris Pressey page on the wiki. 03:04:50 thus fixed 03:05:06 thank you, oerjan 03:05:10 how's it going? 03:05:59 * pikhq goes back to wondering how ehird is going to pull off PEBBLE in PEBBLE. 03:06:08 well ihope_'s redivider and ehird's plan to self-host PEBBLE seems the current rages 03:06:23 and /mes sgt999g 03:06:51 i've been out of the loop for a while 03:07:12 Given that I've never seen you here before, and I've been here for over a year, I'd say so. ;) 03:07:51 hey, cpressey 03:08:27 i have a good excuse... i was busy finishing up my degree :) 03:08:31 hey lament! 03:08:35 i've seen cpressey do some wiki posting 03:08:55 cpressey: done studying? 03:08:55 Hmm. . . Someone who has *not* heard of PEBBLE yet. :p 03:09:20 i'm currently stuck in southern ontario, but i got a laptop and have been working on esolangs. 03:09:28 oh dear. cpressey, RUN! 03:09:43 LMAO 03:09:43 lament: yep, i don't officially graduate until december, but i've completed my requirements 03:10:02 oerjan: from what? 03:10:16 Hmm. . . Someone who has *not* heard of PEBBLE yet. :p 03:10:18 pikhq: btw, there doesn't seem to be an eso wiki entry for PEBBLE 03:10:24 oerjan: oh. 03:10:24 cpressey: Grr. 03:10:27 Need one. 03:10:31 cpressey: which university do you graduate from? 03:10:39 (too lazy to write one. . .) 03:10:39 lament: UBC. 03:10:45 oh, okay 03:10:48 lament: was that a trick question? :) 03:11:03 PEBBLE is a Brainfuck-targetting macro language I've devised. I'm kinda proud of it. 03:11:18 although i guess i had credits from before... but it's the university you finish at that counts 03:11:33 cpressey: i thought maybe you changed universities again, if you're in southern ontario 03:11:47 cpressey: welcome, great one 03:12:00 lament: ah, i see. no, i'm in ON for completely different reasons. 03:12:18 Now if we can get Gregor to talk, we can have a party of esolang designers. :p 03:12:22 hello, RodgerTheGreat 03:12:36 wouter showed up on here once too 03:12:39 (and our local dieties, for that matter) 03:12:47 but it was once, and it was while i was asleep 03:13:00 he used to be a regular 03:13:04 semi-regular 03:13:08 a long long time ago 03:13:13 before my time 03:13:28 Acme super-fiber drinks and shakes keep me regular! 03:13:43 maybe not regular, but he showed up more than once :D 03:13:53 I humbly offer this piece of syntax: [clear 1 disp 0 1 !fibo] :run [copy rollup add copy disp copy 144 nequ [!fibo] if] :fibo !run 03:14:28 I offer this syntax instead: source ^stdcons.bfm;@ temp1;@ temp2;stringout "Hello, world!\n" : temp1 temp2 03:15:32 wow, i have no gnarly syntax to offer in return 03:15:42 cpressey: have you looked at all the nonsense about the wolfram research prize? 03:15:50 we do not wish to trade, only for your blessings 03:17:01 cpressey: it seems there's a question of whether to allow infinite initial conditions, and if so then of what kind 03:17:21 Ask ais523 if he shows up again. 03:17:28 oh, you have my blessings, except that i feel like i'm in "life of brian" or something 03:17:38 LMAO 03:17:40 lament: hm. 03:17:47 haha 03:18:05 cpressey: like, a game-of-life turing machine emulator probably needs an infinite tape 03:18:11 infinite initial conditions seem fair enough, it was used for wolfram's r110 as well but there i think it was simply repeating in each direction 03:18:12 cpressey: so it seems fair to allow that 03:18:15 lament: yeah, i think i thought about that at some point in the summer 03:18:21 sweet, now I can add "BLESSED BY A GREAT ONE" to the Sprocket manual. 03:18:50 lament: but there need to be limits on what the infinite initial configuration is 03:18:52 oerjan: well, if you allow arbitrary infinite initial conditions, then the halting problem can be solved trivially 03:19:10 so it's a question of how much to allow 03:19:42 * pikhq adds "Blessed by 2 Great Ones" to the PEBBLE docs 03:19:45 i could accept something that can be recognized by a regular expression or maybe even a CFG 03:19:54 * pikhq calls oerjan a great one. :p 03:20:00 in that case smetana is turing-complete 03:20:42 you just need infinitely big programs, consisting mostly of identical, except for the numbers that are all shifted equal amount, chunks corresponding to "memory cells" 03:20:51 lament: we've been over this :) the problem is that a smetana program only has a finite number of instructions. i grant you that if there were an infinite number, it could be 03:21:07 lament: we seem to be on the same track 03:21:10 cpressey: if you allow infinite starting conditions, that's equivalent to allowing infinite programs 03:21:47 lament: ok, maybe we need to clarify something. i have no idea what the wolfram research thingy is, for example 03:22:03 so i might be speaking without knowing what we're talking about exactly 03:22:10 wolfram wanted a proof that some turing machine is universal 03:22:15 http://www.wolframscience.com/prizes/tm23/solved.html 03:22:24 a guy from #esoteric (ais523) proved it 03:22:25 danke 03:22:42 oh, that one 03:22:47 hmm 03:23:35 it's an interesting question, how much complexity can you put in infinite conditions 03:23:50 clearly "the memory is initialized as an infinite stack of zeros" is perfectly fine :) 03:23:56 man, i did not need to be reminded about how fatuous wolfram is 03:24:04 lament: yes. 03:24:11 in fact 03:24:22 damn, i can't type quickly enough on this toy kbd 03:24:39 this is the same problem with wolfram's CA - i noticed it earlier 03:25:02 his CA is not TC because there's one thing that a TM can do that his CA can't - that is, halt 03:25:29 he's seriously distorting the definition of Turing-complete by claiming that rule 110 is TC 03:25:50 yeah, you need an observer smart enough to realize that it "halted" 03:25:56 together the system is obviously TC 03:26:09 the observer doesn't have to be very smart 03:26:15 lament: exactly, you need a halting predicate, and implementing that predicate *will take more states* if not more symbols 03:26:38 One could argue that having the cellular automaton stabilise is 'halting'. 03:26:44 bsmntbombdood: not very smart, but just smart enough to make his machine bigger than minksy's :) 03:27:09 pikhq: how do you know that it's stabilized, though? 03:27:12 heh 03:27:43 i'm sure there is some finite automaton to check each generation, isn't there? 03:28:04 actually, this ties in with something else i've been thinking about regarding TM's - they don't need infinte tapes, only expanding tapes. 03:28:39 The two are, for all intents and purposes, the same. . . 03:28:47 yes, and smetana doesn't need infinite programs, only expanding programs :) 03:28:53 in this case, you can think of an 'initial pattern' as being generated on the tape, every time you extend it 03:29:04 and for that you need some kind of mechanism. more states. 03:29:15 lament: ok, ok! :) 03:29:22 infinitely expanding tape, which is pretty much the same thing 03:29:38 pikhq, bsmntbombdood: yes. they're equivalent. 03:30:03 * pikhq comments on #esoteric being much more educational than high school. . . 03:30:13 it's mainly tradition that keeps the description of a TM starting off with "Well it has this infinte tape you see, and..." 03:30:26 True, true. 03:31:07 i mean there's good reasons for it to not have a limit 03:31:10 but anyway, yeah. 03:31:35 i agree that ther are definate problems with wolfram's 2,3 machine's "universality" 03:32:21 i would maybe be OK with it being called a kind of universality, but it's not the kind that's used in computabilty theory 03:33:06 in computability theory, people are concerned with decision problems, and semi-decision problems, and that stuff. if you can't halt, though, you can't decide anything. 03:33:54 i still think smetana is tc :D 03:34:10 lament: fine. for you, it's TC :) 03:34:24 i'll add that stipulation to the language definition :) 03:35:12 if we allow infinitely repeating initial conditions 03:35:27 then the only reason _against_ it being TC is if we for some reason treat code differently from data 03:35:32 can a fsm be turing complete if it has infinite states? 03:35:43 bsmntbombdood: it can't be a fsm :) 03:35:49 lament: i'm actually perfectly OK with there being a tiny variation on smetana (like, to give it the ability to make new instructions) to let it be TC, but i'd sort of prefer that that variation have a diferent name 03:36:06 Tsmetana. 03:36:09 bsmntbombdood: since the states could include the whole content of a turing tape, yes 03:36:32 pikhq: how about "Etanasmay"? :) 03:36:33 um, i already named it Smetana+1 03:36:41 cpressey: but why? what's wrong with my logic? 03:36:47 5 years ago or so 03:37:14 lament: your logic... well, is smallfuck TC? 03:37:23 cpressey: if we allow infinitely repeating initial conditions for CA, might as well allow them for smetana. 03:37:43 oerjan: i must've missed that. 03:37:52 after which it can interpret regular brainfuck 03:37:52 was on the mailing list 03:38:27 lament: BUT... CA are generally defined to have *unbounded* playfields. SMETANA is not. like most programming language, the program is assumed to be of fixed size during execution. 03:38:33 cpressey: the only problem with that is "you can't have infinitely big programs", but how's that different from having infinite starting conditions for a CA? 03:38:48 oerjan: i unsubscribed to it ages ago. 03:39:10 i'm still subscribed, haven't received any mail in many years 03:39:45 wow, that busy huh? mailing lists were a lot more interesting in the earlier days of the internet than they are now 03:40:10 lament: grrrr :) 03:40:36 hm, there's been activity on the esolangs forum 03:40:36 lament: it's not that you can't have infinitely long programs, it's that SMETANA isn't defined for them. 03:41:00 -!- GreaseMonkey has joined. 03:41:11 lament: unlike most CA, which, being mathematical beasts, are a bit more flexible, i suppose you could say. 03:41:25 first new post starts with "I wish this forum was more active." :S 03:41:28 cpressey: so a language just like smetana but allowing infinitely long programs is 1) turing complete 2) capable of being interpreted by, for example, CA, since they allow the entire smetana program to be given as starting conditions 03:41:29 i haven't looked at the forum either 03:41:37 -!- importantshock has quit (Read error: 110 (Connection timed out)). 03:41:42 lament: 1) yes 2) yes 03:41:55 it's not usually very active. 03:42:15 lament: in fact, the programs can be infinitely long and blank in all but a finite number of instructions, i thin 03:42:33 smetana doesn't have blank instructions! 03:42:40 "blank" in SMETANA being something like, Step n. Go to step n. aybe? 03:42:41 "blank" doesn't even mean anything 03:43:16 cpressey: no, you need the ability to change infinitely many steps, which means there needs to be Swaps referring to them. 03:43:16 "blank" in the sense of "not useful" (unlike the starting configuration of a CA, where you might want an exquisite infinite pattern) 03:43:27 oerjan: hrm. ok, maybe. 03:44:01 haven't given it much thought, honestly, it's just that lament keeps bugging me about it :) 03:44:04 :D 03:44:33 alternatively, i went one step further with Moldau which really only needs Goto, but where labels are general data structures 03:45:28 oerjan: excellent. i really have been out of the loop 03:45:36 but i've been busy, too 03:45:55 well i never implemented either... as usual. 03:46:25 no wiki entry for Moldau either 03:46:45 it was only on the mailing list too 03:48:30 i've been on an abstact algebra kick lately 03:48:40 asbtRact algebra, even. 03:48:49 or... oh, forget it. 03:48:56 I've been on a calculus kick for the past year, myself. 03:49:00 * cpressey hates toy laptp keyboards 03:49:30 pikhq: managed to work any of it into an esolang? :) 03:49:43 cpressey: Nope. 03:49:56 Perhaps I should. 03:50:07 there's some stuff that steve smale (famous-pants mathematician) has done regarding computability in the reals that's kind of interesting 03:50:18 find a domain where integration is turing complte 03:50:29 penrose made some remark about how the mandelbrot set is uncomputable or something 03:50:54 * pikhq *must* now make an esolang that nobody else in his high school will understand 03:51:09 -!- Tritonio has joined. 03:51:19 if anyone in your high school understands brainfuck, you've got a crazy ass highschool 03:51:23 pikhq: i found it interesting that taking derivatives is basicall mechanical but taking antiderivates is... well, not 03:51:35 I'm the guy that understands Brainfuck. :) 03:51:36 but otherwise i suck at calculus 03:51:43 we;;. yeah 03:51:51 cpressey: I'm quite good at calculus. 03:51:57 :D 03:52:08 what about lambda calculus 03:52:31 -!- sp3tt has quit (Read error: 110 (Connection timed out)). 03:52:32 I'm not much of a Knight of the Lambda Calculus. 03:52:37 (although I'd love to be one) 03:53:13 now there's a though. try to merge lambda calculus with calculus (real-analysis "regular ol'" calculus) 03:53:21 Mmmm. 03:53:22 i be willing to wager a few day's wages that i'm the only one at my high school that understands unlambda 03:53:33 bsmntbombdood: As would I. 03:53:37 I make $0.00 a day. 03:54:18 lament: are you going to graduate soon, as well? 03:54:18 me too, but even if i didn't :P 03:54:54 and does jeffrey johnston still hang out here? 03:56:02 i see GregorR and jix and mtve in the userlist, so there's some regulars from days gone by still here it seems 03:56:52 Oh hey 03:57:00 Surprise reappearance 03:57:12 GregorR: hello, hat-wearing moxie-guzzling fellow 03:57:24 * GregorR hasn't had Moxie in far too long :( :( :( 03:57:50 cpressey: yeah, done courses in december, graduating in may 03:58:15 lament: cool 03:59:36 -!- immibis has joined. 04:00:13 http://catseye.tc/projects/burro/ 04:00:30 that's what i've been doing lately. 04:00:42 actually, i've been doing it off and on for the past 2 years 04:01:06 followed by http://catseye.tc/projects/cabra/ 04:01:47 excuse the awkward presentation - i am no mathematician 04:01:54 ah, reversible programming 04:01:59 oerjan: sort of. 04:02:32 that was sort of an unforseen side-effect of making it a group 04:03:29 and burro programs don't really get reversed so much as they get... annihilated. it's not like they're "rewound", it's more like they never existed (the semantics cancel out to get NOP) 04:03:36 the next one is vaca? 04:03:56 lament: well, i was thinking "potro", but vaca is a good suggestion too 04:04:19 if there is a next one. i'm a bit burnt out on abstract algebra now 04:07:14 RodgerTheGreat: jeez, no wiki entry for Sprocket either?!? :) 04:07:23 sorry 04:08:12 RodgerTheGreat: is there a doc i can download somewhere? 04:08:35 I can pastebin a very brief command summary 04:08:50 http://nonlogic.org/dump/text/1193972891.html 04:09:17 RodgerTheGreat: ah... so that's the syntax you sent earlier... gotcha 04:09:30 yeah. :) 04:10:18 and dare I ask pikhq about PEBBLE? 04:14:31 -!- GreaseMonkey has quit ("rebooting to test an OS"). 04:17:19 http://pikhq.nonlogic.org/esoteric.php 04:20:50 -!- GreaseMonkey has joined. 04:20:54 i see... interesting 04:22:43 quite a few languages added to the wiki, too. nice. 04:28:06 At least one of them is mine. 04:32:58 -!- immibis_ has joined. 04:42:12 * pikhq cheers, for Plof no longer has the thick-and-thin functions 04:45:33 -!- immibis has quit (Read error: 110 (Connection timed out)). 04:52:57 -!- immibissClone has joined. 04:53:05 -!- immibissClone has changed nick to immibis. 04:53:07 -!- immibis_ has quit (Nick collision from services.). 04:54:01 oerjan: I've got an idea for Agora. Pity you're not in it; otherwise, I'd ask you for assistance with it. . . 04:54:45 (define a partnership. That partnership's rules shall be that of a Nomic. Subnomic. :D) 04:55:07 you're in Agora? 04:55:14 Yes, I am. 04:55:22 And I notice that you won it once. 04:55:24 small the world is 04:55:48 * pikhq nods 04:56:01 I was interested in FRC once.. 04:56:03 the world is big, the internet is pretty small though 04:56:20 * Sgeo is on the Agora discussion thing for some reason 04:56:22 just a few hubs of cool stuff in the vast badlands of porn 04:56:28 * pikhq wonders why 04:56:31 (never has the word badlands been more appropriate) 04:56:46 NEW XKCD SOON! 04:56:51 :) 05:00:19 YAY 05:00:39 * pikhq wants someone to join him in the Subnomic Partnership. 05:00:45 :) XKCD! 05:01:08 When I have time (never) I'll look at Agora again 05:01:41 you are aware that FRC started as a Subnomic of Nomic World, and Agora rose from its ashes? 05:02:01 oerjan: Then let's be nostalgic. 05:02:43 no. 05:02:48 *shrug*\ 05:03:12 * pikhq should probably hold off on that, anyways. . . 05:03:28 Agora is currently swamped with 10,000 CFJs. . . 05:03:37 o_O 05:04:03 (I call for judgement on the following statement 10,000 times: This is Sparta.) 05:04:59 (worst movie ever?) 05:05:30 * pikhq kinda hopes that his proposal on removing all changes in game state caused by that is passed. . . 05:18:43 -!- immibis has quit (Nick collision from services.). 05:18:50 -!- immibis has joined. 05:19:51 -!- immibis_ has joined. 05:26:34 -!- bsmntbom1dood has joined. 05:27:18 -!- jix has quit (Nick collision from services.). 05:27:30 -!- jix has joined. 07:39:18 -!- clog has joined. 07:39:18 -!- clog has joined. 07:39:36 -!- SEO_DUDE56 has quit (Excess Flood). 07:40:15 -!- oerjan has quit ("Something"). 07:41:26 hmm 07:44:51 -!- i4nic8 has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.8/2007100816]"). 07:47:36 -!- SEO_DUDE56 has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:09:55 -!- bsmntbombdood has joined. 08:21:20 -!- bsmntbom1dood has quit (Read error: 110 (Connection timed out)). 08:21:23 -!- SEO_DUDE56 has quit (Remote closed the connection). 08:35:46 -!- SEO_DUDE56 has joined. 08:42:25 -!- i4nic8 has joined. 08:43:41 -!- i4nic8 has quit (Client Quit). 09:50:29 -!- GreaseMonkey has quit ("gnight"). 10:55:57 -!- bsmntbom1dood has joined. 11:02:16 -!- RedDak has joined. 11:07:17 -!- bsmntbombdood has quit (Read error: 110 (Connection timed out)). 12:13:10 -!- Tritonio has quit (Remote closed the connection). 13:18:57 -!- Keymaker has joined. 13:19:27 any chance chris pressey is here? 13:20:54 i guess not... 13:20:58 -!- Keymaker has left (?). 14:13:45 -!- Tritonio has joined. 14:49:22 -!- RedDak has quit (Remote closed the connection). 15:08:21 -!- RedDak has joined. 15:19:57 -!- ehird` has joined. 15:49:25 -!- RedDak has quit (Remote closed the connection). 17:27:31 -!- jix has quit (Nick collision from services.). 17:27:43 -!- jix has joined. 17:35:03 -!- bsmntbom1dood has changed nick to bsmntbombdood. 17:39:13 -!- sebbu has joined. 17:43:56 -!- oerjan has joined. 19:32:34 i 19:32:36 ... 19:32:37 i mean 19:32:37 o 19:33:22 u 19:33:49 u? :| 19:33:55 e 19:34:07 you're one weird fella! 19:34:26 hey, you started it 19:50:26 i said "o", you said "u", there's a great difference. 19:51:51 ah but first you said i 19:51:59 a very egoistic thing to say 19:52:21 grEGOrrtistic?! 19:52:35 o_O 19:52:47 is that how EgoBot was named? 19:53:01 ... 19:53:03 of course. 19:53:10 that's how all Ego* projects are named 19:53:17 ... did you not pick up on that? 19:54:08 i mean, from grEGOr 19:54:17 yeah 19:54:25 that's how all of Ego* projects were named 19:54:29 [e.g. EgoBF] 20:07:25 -!- sebbu2 has joined. 20:07:38 -!- puzzlet has quit (Remote closed the connection). 20:07:45 -!- puzzlet has joined. 20:08:00 oerjan: you are right, i may have been a bit selfish there by accident 20:08:45 hmm, where's all the time slippin', it's like 20 min since i last spoke and i haven't really done anything... 20:09:06 ahtiuhariuthkjghlkdfhgkjdafghkadhg stupid windows and stupid router and stupid firewall 20:09:33 ahtiuhari is very finnishish 20:09:38 sdfsdfsdffhkfjhafkhsldf 20:09:51 Firefox can't establish a connection to the server at 84.65.88.163:8080. 20:09:52 WELL WHY NOT 20:09:54 oklopol: my sentiment exactly 20:10:03 ahti is like the god of sea or something, uhari could be a slang way to say uhkalaukaus or something 20:10:10 not that uhkalaukaus would mean anything 20:10:11 rtrklrktkrlktrsklrtrlt is very czech 20:10:15 (thread shot) 20:10:17 *threat 20:10:53 ok, list of what i've done 20:10:54 set up DMZ 20:11:02 disabled router firewall + personal firewall 20:11:07 and yet 20:11:13 it STILL won't load the page 20:14:21 why is this not working??? 20:16:04 you want to visit _that_ page? 20:16:12 you evil, evil man 20:16:55 what did the poor squirrels do to you? 20:17:08 ... 20:17:14 my local webserver's page. 20:17:20 ah. 20:17:32 i can access it from 127.0.0.1 20:17:36 just not from the outside world 20:17:41 it never even hits my personal firewall 20:18:22 me neither. 20:18:41 helpful 20:18:53 squirrel porn is awesome 20:19:44 -!- bartw has joined. 20:21:47 ... i had it bound to localhost 20:21:49 STUPID STUPID STUPID 20:21:55 hi bartw 20:22:40 ellow 20:23:22 Of course predictably it still doesn't work :| 20:23:56 right, on with the compiler building 20:24:45 Shieldsup says the port is stealth :| 20:26:02 GRRRRRRRRR 20:27:18 -!- sebbu has quit (Read error: 110 (Connection timed out)). 20:27:45 ahahahaha 20:27:49 i forgot to change the port in my firewall 20:31:49 hmz 20:31:55 argh 20:31:58 a.x() 20:32:17 if a.x is a valid expression returning a function pointer 20:32:29 does that mean the overloading isn't possible 20:32:59 no 20:33:13 a.x()() 20:33:38 a.x()()() 20:34:19 DISCLAIMER: Gregor doesn't have a clue WTF you're talkinga bout :) 20:34:23 *talking about 20:34:33 obviously 20:38:22 i'm assuming bartw asked whether it's possible to define a language where a.x can have multiple definitions 20:38:35 i'm pretty sure it's possible 20:39:23 several languages have the concept of method overloading, disambiguated by parameter count and type 20:39:48 o 20:39:50 but if you start to juggle with functionpointers, hwo do you disabiguate 20:39:50 but this isn't the channel for this it seems 20:40:33 sure it is 20:40:35 Depends on how you define your overloading. 20:40:47 Is overloading name -> many functions or function -> many effects 20:41:10 in this case, 1 name, several functions 20:41:14 bartw: depends on call semantics... it's trivial to convert overloading into pattern amtching. 20:41:17 *matching 20:42:07 -!- puzzlet has quit (Remote closed the connection). 20:42:14 -!- puzzlet has joined. 21:05:14 -!- cpressey has joined. 21:05:26 -!- puzzlet has quit (Remote closed the connection). 21:05:33 -!- puzzlet has joined. 21:31:30 -!- oerjan has quit ("Supper"). 21:33:39 -!- cpressey has quit (Read error: 110 (Connection timed out)). 21:42:02 bye everyone 21:42:10 -!- RodgerTheGreat has quit. 21:53:52 -!- cpressey has joined. 22:22:12 -!- cpressey has left (?). 23:10:00 -!- GreaseMonkey has joined. 23:11:41 -!- jix has quit ("CommandQ"). 23:25:08 prize for making the shortest equivelant to +++++++++++++++[>+>++>+++>++++>+++++>++++++>+++++++>++++++++<<<<<<<<-] 23:25:43 [Hello interpreter]!H 23:26:03 bsmntbombdood: WE ARE NOT DOING YOUR HOMEWORK! 23:26:17 that is, put [16*1, 16*2, 16*3, 16*4, 16*5, 16*6, 16*7, 16*8] in the tape 23:26:27 it's not my homework :( 23:26:29 oh 23:26:30 hm 23:26:43 if it were, i'd be totally jealous 23:26:55 [Put16TimesNForNinARangeFrom1to8OnTape Interpreter] 23:28:55 ... 23:29:22 when in doubt, invent a language that can do it 23:29:40 hmm i wonder if it would be shorter to put [1,2,3,4,5,6,7,8] on the tape and map *16 across it 23:29:52 try it 23:30:06 maybe try not having 16 +s 23:31:09 i dunno how 23:31:19 BF constants page, high-ho 23:31:24 not that 23:38:42 i basically want the shortest code to load a number and all/some of its factors 23:43:27 wapr has been out for ages now and nobody's written anything in it ;P 23:44:50 (http://esolangs.org/wiki/Wapr, the stuff there is stack comments, not argument syntax) 23:44:56 it is most likely turing complete 23:44:58 -!- GreaseMonkey has quit ("getting off, i will pack this up soon"). 23:45:25 What about the 100-character BF program that outputs the most? 23:45:38 Tape infinite both ways, cells hold integers. 23:46:25 isnt' that the busy beaver problem 23:46:25 :P 23:46:48 Yes! 23:46:53 hah 23:47:21 it's good to know i recognize is 23:47:24 *it 23:49:04 My entry: +++[->+++<]>[->+++<]>[->+++<]>[->+++<]>[->+++<]>[->+++<]>[->++<]>[->++<]>[->++<]>[->++<]>[->++<]>[..-] 23:49:24 heh. 23:49:36 it's too long 23:49:39 5 char would be better 23:49:44 bsmntbombdood: (10:55:55 PM) ihope_: What about the 100-character BF program that outputs the most? 23:49:44 (10:56:08 PM) ihope_: Tape infinite both ways, cells hold integers. 23:49:58 what? 23:50:09 that was ihope_'s entry to the above 23:50:14 i know... 23:50:17 oh 23:50:17 :| 23:50:18 ok 23:50:20 oh 23:50:21 i get it now 23:50:22 ok 23:50:25 5 char competition 23:50:52 my entry: +[..] 23:51:01 infinite output, i win 23:51:04 it has to halt 23:51:26 bah 23:51:29 that's impossible then 23:51:35 basically the max you can get is +[.+] 23:51:35 impossible? 23:51:47 and cells aren't wrapping... 23:52:04 damnit 23:52:05 ok 23:52:10 show me YOUR 5 char entry 23:54:23 ;) 23:56:25 didn't think so,h eh 23:57:13 my 5 char entry is ..... 23:57:37 how about 8 chars 23:57:57 let's find the lowest number where the number of prints is greater than the length 23:58:05 +[...++] 23:58:07 hm 23:58:10 doesn't halt 23:58:13 bsmntbombdood: heh 23:58:19 bsmntbombdood: that might be hard 23:58:22 ihope_ might do it though 23:58:30 considering he started this mess ;)