00:53:16 -!- calamari has joined. 01:15:25 -!- calamari has left (?). 01:25:40 -!- Sgeo has joined. 01:26:01 -!- sebbu has quit (Success). 01:57:57 -!- sarehu has joined. 02:17:13 -!- sarehu has quit (Read error: 110 (Connection timed out)). 02:50:45 -!- ehird` has quit ("K-Lined by peer"). 03:13:17 -!- GreaseMonkey has joined. 03:15:47 * Sgeo is a beneficial mutation occuring in your lab. 03:18:55 what's everyone up to tonight? 03:19:12 Preparing THE HOLY WAR ON SCIENTOLOGY 03:19:16 (I bought a swell mask) 03:20:02 Also to sleep. 03:20:04 It's 4AM 03:20:14 g'night 03:20:25 cya- make a good stand for anonymous 03:21:10 Slereah: Would said mask bear any relation to Guy Fawkes? :p 03:21:17 I'm going to eat then work on PSOX 03:21:50 pikhq: I'd say so. 03:21:51 Sgeo: BTW, for PSOX in PEBBLE2: you're in luck. I'm going to have an actual *type system* in there, I believe. 03:22:24 Although it will arrive in time for the second protest, in March. 03:22:32 pikhq, :).. 03:22:43 pikhq, did you note my changes to the File Descriptor system? 03:23:05 With that, I need to eat 03:23:10 Sgeo: Not yet. 03:24:55 I'm really in the mood to draw something. Any requests/ideas? 03:25:21 http://pastebin.ca/895846 03:25:30 I hope that, when I'm done, that will compile. 03:26:02 s/!:/!=/ 03:26:05 Thinko there. 03:29:04 RodgerTheGreat: Thoughts on my idea? 03:29:28 Anyways: for you to draw: more of that series with the robotic revolution. 03:29:41 Actually, you should probably stick it on your nonlogic page, so that it's easier to find. 03:29:51 pikhq, http://trac2.assembla.com/psox/changeset?new=trunk%2Fspec%2Fpsox.txt%4053&old=trunk%2Fspec%2Fpsox.txt%4038 03:29:58 (I know, I know, I could grep nonlogic dump and #esoteric logs. . . But I don't wanna) 03:30:10 Sgeo: Comments on my PEBBLE2 example? 03:30:29 I don't understand PEBBLE2 03:30:49 What don't you understand? 03:30:49 Oh, is that a proposed thing? 03:30:54 hm. I suppose I could do that 03:31:01 Yes. 03:31:16 I've not implemented it; I've mostly been coming up with code examples while thinking of implementation. 03:31:39 it looks like a pretty ambitious attempt at a macrolanguage 03:32:33 Which I think is appropriate for PEBBLE2. 03:32:44 The only hard part is going to be that expr command, I suspect. 03:32:53 * Sgeo goes to eat 03:33:26 going with infix notation makes your job quite a bit more complex 03:33:32 might I suggest RPN? 03:34:10 especially if you want to self-host- the only clean ways to do infix require converting to RPN or using recursion, and recursion does not lend itself well to BF 03:36:27 I'm not going to self-host. 03:36:38 aw. :( 03:36:44 How I'm thinking of doing the type-system and the allocation of variables does not lend itself to it. 03:37:17 I can either make it self-host, and have it be basically PEBBLE 1 done a bit more rigourously, or make it t3h awesome, and not have it self-host. 03:37:43 (I *really* don't want to do garbage collection from within BF) 03:38:00 Although making it RPN or Polish may help me out a bit. 03:38:27 Probably Polish because, after all, I already have commands like ":= $i 5" and "+= $i 5". . . 03:38:44 Making the expression parser handle those commands in the same way is merely consistent. 03:38:57 there you go 03:41:23 PEBBLE2 should end up making all PEBBLE code a hell of a lot cleaner as a result. 03:42:05 I'm really looking forward to making PFUCK about as trivial to write as a C version would be. :p 03:53:22 -!- immibis has joined. 04:22:22 I need a last name 04:49:59 nvm 04:50:17 alright, I'm drawing these really fast, but I think you guys will still enjoy them 04:57:01 http://rodger.nonlogic.org/images/axon/ 04:57:08 behold, pages one and two 04:59:59 Not bad. 05:00:20 lemme rest my hand for a bit and I'll do some more 05:00:26 Mmkay. 05:01:12 Would you class having a copy of your GPG revocation certificate and a secure way of encrypting your data as paranoid? 05:01:59 depends on the data 05:02:17 (I do neither ATM: I just have the means to) 05:02:23 tax records, not paranoid. grocery lists? paranoid. 05:03:24 * pikhq encodes his grocery list with tax records as the one-time pad. :p 05:04:44 this is a notable sign of a profusion of free time 05:05:49 Not really. I set all that up in half an hour. 05:06:18 . . . Perhaps a bit of free time. 05:06:39 there we go 05:06:56 -!- immibis has quit (Read error: 110 (Connection timed out)). 05:07:23 Of course, if/when I finish PEBBLE2, then we can say that it's a truly insane amount of free time used. :p 05:07:35 Hell, the same applies to PEBBLE 1.0. . . 05:07:42 I *did* spend the better part of a year on that. 05:07:53 you're talking to the guy that spent a good chunk of 8 months writing a Java-based Pokemon clone. 05:08:17 You're talking to a guy who's been tempted to do the same in a different language. 05:08:38 hey, my source is an open book. :) 05:08:39 I'd say we're about equal on the free time front. 05:08:56 right now, at least 05:09:10 I tend to take my free time in small, sharp doses 05:09:11 I have yet to enter college, so. . . 05:11:03 You'd be amazed at how much work teachers think they can assign just because it's an 'honors class'. 05:11:17 college devours your free time like no other. I was only able to work on CRPG during my vacation time- I would spend the first few days lying around, playing with my cats and watching TV, recharging. Then, I would code like a madman, laying down the ideas that had been splintering away in the back of my head for months. 05:11:34 When I have an actual college class (calc II) that has less homework than high school classes, you know something's up. 05:11:59 (either my teachers are insane, or that college sucks. :p) 05:13:53 Can I give this line to a computer-illiterate person? 05:13:54 "Downloading files SHOULD be safe, provided you do NOT open or run them." 05:14:10 She stopped opening attachments and reading emails from non-@farmingdale.edu 05:14:10 Sgeo: Ask one of them. 05:14:13 We wouldn't know. 05:14:41 I'm trying to help tell this person what is and isn't safe.. 05:14:51 Are PDFs safe? >.> 05:15:03 PDFs are safe 05:15:20 they do, interestingly, encapsulate several TC languages 05:15:21 "application/pdf == Safe for Abode Reader to read, bad for Acrobat 4.0 and 5.0 (I think)" 05:15:27 PDFs are little more than Postscript that feels fairly uppity. 05:15:38 "image/jpeg == Once problematic, should be safe if Windows is kept up-to-date" 05:15:50 "application/msword == MS Word document, safe if your macro security 05:15:50 settings are safe" 05:15:58 "application/x-msdos-program == BAD BAD BAD" 05:16:31 Oh, yeah. . . I forget that this whole 'Microsoft' thing seems to think that executing arbitrary executable code in arbitrary files (even non-executable ones) is a good idea. . . 05:18:45 .PIF with .EXE format 05:19:38 .PIFs would be application/? 05:21:41 appliccation/x-pif, I think. 05:24:54 "application/(anything else) == I can't predict every attachment, probably not safe" 06:11:37 -!- Sgeo has quit (Remote closed the connection). 06:55:07 two more pages: http://rodger.nonlogic.org/images/axon/ 06:59:00 pikhq? 07:10:48 well, good night everyone 07:17:04 -!- oerjan has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:49:24 -!- GreaseMonkey has quit ("Hi Im a qit msg virus. Pls rplce ur old qit msg wit tis 1 & hlp me tk ovr th wrld of IRC. and dlte ur files. thx."). 09:29:56 -!- oerjan has quit ("leaving"). 10:03:16 -!- sebbu has joined. 10:24:33 -!- puzzlet has quit (Remote closed the connection). 10:24:41 -!- puzzlet has joined. 10:57:02 -!- puzzlet has quit (Remote closed the connection). 10:57:10 -!- puzzlet has joined. 11:11:14 http://www.enterprise-architecture.info/Images/Documents/symeph%5B1%5D.pdf 11:11:15 I particularly recommjend page 11 11:11:16 utter gobledegook 11:11:21 also: lol 11:11:53 -!- sebbu2 has joined. 11:20:09 in fact, their whole website looks a bit TDWTF-worthy 11:27:53 -!- sebbu has quit (Read error: 110 (Connection timed out)). 12:16:22 -!- helios24 has joined. 12:23:29 hi 12:23:36 -!- Slereah has quit (Remote closed the connection). 12:32:23 -!- Slereah has joined. 13:24:03 expr isn't that hard, infix -> rpn is trivial, and rpn -> brainfuck is not that hard 13:30:51 -!- jix has joined. 13:37:17 -!- helios24 has quit ("Leaving"). 14:43:01 -!- RedDak has joined. 15:07:16 -!- timotiis has joined. 15:12:11 -!- cepera has joined. 15:19:54 -!- cepera has quit ("freenode.net"). 15:31:50 -!- ais523 has joined. 15:34:29 hi 16:03:04 -!- Slereah has quit (Read error: 104 (Connection reset by peer)). 16:03:43 -!- Slereah has joined. 16:09:30 SimonRC: belated hi 16:20:07 -!- Sgeo has joined. 16:24:51 Hi all 16:25:08 I might release an alpha version of the PSOX ref. interp. soon! 16:25:57 Anyone other than me excited? 16:26:08 Depends, you've got some drugs? 16:28:14 * SimonRC takes arylstantanine 16:40:44 I decided that a lot of parsing should occur in @argtypes 16:41:11 or maybe not 16:48:15 Itsy Bitsy Teenie Weenie Yellow Polka-dot Clarification 16:48:44 ^^ used that as a commit message 16:49:15 * ais523 performs the sort of action which usually results in coffee spilling over a computer keyboard, but doesn't due to an empty mouth 16:59:42 I'm too obsessed with that now to implement PSOX :/ 17:06:14 ? 17:06:24 * ais523 uses single-character smilies 17:09:41 Alpha version will implement the pseudodomains and domain2 17:24:00 -!- RedDak has quit (Remote closed the connection). 17:24:52 * Sgeo feels like everything's close to completion 17:46:49 -!- RedDak has joined. 17:48:22 -!- Dagide has joined. 17:48:53 -!- RedDak has quit (Client Quit). 17:49:03 -!- Dagide has quit (Read error: 104 (Connection reset by peer)). 17:49:19 -!- RedDak has joined. 17:49:31 -!- Hiato has joined. 17:49:38 Wassabi all :P 17:50:34 alright, I retract my previous statement and insert an "Hello all :)" 17:51:23 * ais523 replies 17:52:00 hehe 17:52:24 s/all/world! 17:52:34 s/ /, / 17:52:45 ///? 17:53:11 * ais523 always writes Hello, world! with the comma 17:54:11 * Hiato realises that this is some kind of string handling syntax as of yet unknown to him 17:54:29 it's Perl and sed syntax for substituting regexps in strings 17:54:41 s/A/B = substitute A for B 17:54:41 s/a/b/ changes the first a in some string to a b 17:54:46 aha, ok 17:54:48 s/a/b/g changes all as to bs 17:54:51 cool 17:54:59 what is the g for then? 17:55:02 on IRC, the string that's operated on normally has to be determined from context 17:55:08 It's the same as *B, but * requires the context to be obvious. 17:55:10 without the g, it only makes one change 17:55:18 aha 17:55:57 "This sentence contains many nonsklarkish English flutzpahs, but the overall plugganzip can be glorked from context" 17:56:23 indeed :) 18:01:59 Hiato, excited about a possible alpha release of PSOX today? 18:02:31 very much so, I was not aware of this aforementioned release, but know I am ;) 18:02:32 brb 18:03:55 Do custom domains need to be working for this release? 18:05:54 that is you decision entirely, it would be nice, but hey ;) Also, now is supper, so I'll be back after I've my fill.. 18:07:01 -!- jix has quit ("CommandQ"). 18:11:46 -!- oerjan has joined. 18:13:47 Hi oerjan 18:13:55 Might be an alpha release of PSOX.py soon! 18:14:08 i noticed 18:16:22 It will be just pseudodomains and domain2(System) 18:26:21 -!- oerjan has set topic: fix $ (++) "THE TOPIC IS NOT " . show. 18:28:07 ok, I'm back. Sgeo: any news? 18:28:33 Just pseudodomains and domain2(System), not custom domains yet 18:28:42 and you'll get it via SVN maybe 18:28:55 awesome 18:30:15 -!- helios24 has joined. 18:30:47 -!- olsner has quit (Read error: 110 (Connection timed out)). 18:33:15 Currently, I'm writing a lot of code w/o testing :/ 18:34:10 I would offer to test, but then again, you don't want an idiot smashing randomly at your code ;) 18:35:31 I'll do testing, and hopefully any and all bugs will make themselves obvious 18:42:12 Testing now, trying to fix a bug 18:42:16 Don't know what's causing it 18:44:15 what effects does the bug have? 18:44:32 Nothing is happening 18:44:47 When I do Ctrl-C, I find it's at the point where it retrieves a line from the client 18:45:01 hey guys 18:45:42 -!- olsner has joined. 18:45:46 -!- olsner has quit (Read error: 104 (Connection reset by peer)). 18:45:53 Actually, that's in the loop, so maybe I should throw some prints in 18:47:32 -!- olsner has joined. 18:47:43 It's not getting past that line at all 18:47:58 Maybe I should test with a Python program not a BF one 18:52:24 That's a strange bug, it's misreading the version number.. 18:52:28 But that's a separate issue 18:52:57 Oh, I commented something out without knowing what it does 18:53:28 Ok, fixing that line helps 18:56:54 Oh, it's not working with the BF file at all 18:57:03 It's like the BF interp never flushes its stdout 18:57:16 In the Python file, I'm flushing stdout manually 19:00:55 -!- n0nsense has joined. 19:01:13 Hi n0nsense 19:02:17 hello 19:02:42 no n0nsense here please. we should all speak perfectly cromulently. 19:03:15 I wrote a bot in Tcl with commands to evaluate brainfuck^^ 19:10:02 always a classic. 19:10:08 I wrote mine in Java. 19:10:25 so much useless software in this world. 19:11:25 Is PSOX useless? 19:11:42 well, there are two ways software can be useful- useful to the world, and useful to the maker. Even if nobody else is ever going to see the code, it can still be a good learning experience. 19:11:49 * ais523 saw a suggestion once that it would be possible to perform parallel computing by sending specially-crafted HTTP requests to a huge number of computers in such a way that whether they were accepted/rejected/bounced/replied-to/whatever performed the computation 19:12:22 it would be great if there were some way to write a massively parallel BF interp like that, but unfortunately I doubt it's possible 19:12:33 and besides, you'd probably get sued by people for wasting their bandwidth 19:13:34 -!- RedDak has quit (Remote closed the connection). 19:14:12 it's a beautiful thing to realize that almost any environment can be used to perform computation 19:14:58 before I discovered esolangs, a related pursuit I used to try was to see what environments could be programmed 19:15:10 I used to test them with a simple noughts-and-crosses program that never lost if going first 19:15:31 that program is easy to write because you can write it as four independent threads if necessary that never need to interact 19:15:46 so not a demonstration of TCness or even computational usability, but still impressive 19:15:52 never need to interact? 19:16:02 they don't share resources? 19:16:13 * ais523 was talking in a theoretical sense 19:16:16 I'd assume they share input events and the ability to draw to the screen 19:16:18 you can program it in Paint, for instance 19:16:24 explain. 19:16:33 by using two slightly different colours and bucket-fill as the input mechanism 19:16:44 -!- n0nsense has left (?). 19:17:02 i.e. clicking on any particular location for your move causes the appropriate move to be echoed by Paint because they're connected by a thin line in a different colour 19:17:18 and the point is that there are four move-pairs that can be triggered in any order 19:17:44 -!- danopia`school has joined. 19:17:49 ah, clever 19:19:58 http://filebin.ca/tesmth/OANDX.BMP 19:20:25 that's it with two shades of blue which are hopefully different enough for you to see how it works 19:20:45 hmm... maybe I should make a PNG version. It's years since I last looked at that file 19:21:44 ais523: clever 19:22:51 looking at the dir it's in, it seems I have a winhlp32 and Powerpoint version as well 19:23:02 or maybe the original winhelp 19:23:13 because I used to use Windows 3.1 around that time 19:23:30 woow, asi523 - that's ingenious!! 19:23:37 beautifully thought out :D 19:23:46 ..What looked like a bug was me forgetting how the input function worked... 19:24:56 -!- danopia has quit (Connection timed out). 19:25:08 would I be correct in saying that it is not possible to win? 19:25:19 seriously though 19:25:30 yes, you're correct 19:25:39 in fact that's why that algorithm was chosen 19:25:47 simple, yet impresses people who don't understand programming 19:26:07 indeed, even for those who think they do ;) 19:26:11 that is really pretty neat 19:26:50 I'm sure routing everything took some work 19:27:04 What are we talking about? 19:27:17 an image I mentioned about 7 minutes ago 19:27:32 that gives the illusion of being a noughts-and-crosses program for Paint 19:27:32 ais523 made a tic-tac-toe game in MSPaint 19:28:26 hrm... I'm thinking of messing with this to implement a draw and lose sign (same construction technique I think) - though I'm not sure it's possible because paint is a definite overwrite procedure, if's and dependencies are not really possible.... perhaps lighting up lose/draw letter by letter may work, but then again, there is no way to say for sure what order the squares where played in... 19:29:22 I thought about that too, but never seriously tried 19:29:32 you can think of the floodfill as a much more limited version of wireworld, in a sense 19:30:07 photoshop fill, which fills similar colors (up to a given threshold) as well as exact match, can be used to implement logic gates 19:30:22 yeah, that is an awesome idea :D 19:30:24 Hiato: and you can do a form of sequencing logic- lemme see if I can come up with an example... 19:30:49 I'd like to see this 19:30:51 :) 19:33:22 Well, for some reason it's skipping some input.. 19:33:24 http://nonlogic.org/dump/images/1202499022-seq.png 19:33:37 if our fill color is black 19:33:38 -!- Tritonio_ has joined. 19:33:40 Maybe I should see what the server is sending 19:34:26 actually, whoops- that isn't what I meant 19:34:38 http://nonlogic.org/dump/images/1202499095-seq.png 19:34:40 ^ this 19:35:10 hmm... does that need two fill colours for user input to work? 19:35:14 if all four cyan paths have been filled with black, the pathway from bottom to top can now be filled with a different color 19:35:17 well, yes 19:35:18 The input command is sending stuff all at once 19:35:27 however, you can assign them to left-click and right-click 19:35:33 at least on MS Paint 19:35:48 and I'm pretty sure it's impossible to do anything complex with a single color 19:35:59 so am I 19:36:09 damn, I see know, that is actually very very clever 19:36:24 but the above is essentially an arbitrary-input AND gate. :) 19:36:31 * Hiato goes to work on the lose sign 19:36:36 yes, true 19:37:04 and OR gates are naturally trivial... so you can do combinational logic... holy shit 19:37:15 the only problem is the wire-crossing problem 19:37:28 which can be overcome 19:37:31 and the fact that changing one input can affect another input 19:37:39 That's because when I was trying to fix things, I changed the client a bit 19:37:43 vy using as many layers as necessary with different colours 19:37:44 whereas in most programming languages changing an input only affects the outputs 19:37:56 and spacing in between 19:38:16 ais523: I think it should be possible to overcome that with multiple colors 19:38:32 yes, probably 19:38:48 pretty much what I said :P 19:40:13 The cat program WORKS! 19:40:49 well done 19:40:56 cat from file to file, presumably 19:40:56 with multiple colors, you can certainly have logic gates, but it's too much work for the user 19:40:59 Actually, the Python client that is a client that does cat is 19:41:01 otherwise PSOX isn't really needed 19:41:08 ais523, I'm just testing 19:41:22 But this client in Python is the first PSOX program ever run successfully 19:41:35 hrmm... this requires many and gates 19:41:42 Don't know why BF isn't working 19:42:20 running into wire crossing :( 19:43:35 Another BF program is sending stuff, but this one isn't 19:45:48 lament: I'm not sure- I think it might be possible to do everything with sort of a "two-color logic" 19:45:57 still too much work for the user 19:46:24 hrmm, I'm still on the gates, perfecting and working :P 19:47:22 incidentally, this reminds be of another esolang I was working on 19:47:47 what I can remember is that it was a cellular automaton in 2D 19:48:07 nice :) 19:48:08 that cells only ever changed to be brighter colours, never darker 19:48:17 and that http://pastebin.ca/896573 is a TC proof by emulating rule 110 19:48:24 * oerjan is reminded that 2-coloring is easy while 3-coloring is NP-complete 19:48:25 but I've completely forgotten how the lang worked and never documented it 19:48:28 interesting, what happens after white 19:48:42 Hiato: then the cell can't change at all 19:48:49 in fact, most cells never change more than once, if ever 19:48:54 I see, a shame this wanted documented 19:48:58 it was an experiment in irreversible programming 19:49:01 whilst still being TC 19:49:04 I see... sounds interesting 19:49:13 The client isn't sending stuff! 19:49:19 Why isn't the client sending stuff! 19:49:23 however, the only way to recover the spec now is likely to reverse-engineer it from the one surviving program 19:49:34 Sgeo: block buffering perhaps? 19:49:41 hm? 19:49:57 are you flushing the output after every write? 19:50:13 Maybe the person who wrote the bf interp is an idiot and . sets the current cell to 0 19:50:16 if you aren't, pipes between programs sometimes will store up a lot of data and then output it all at once, for efficiency reasons 19:50:27 a file can be unbuffered, line buffered or block buffered. with the last output is only sent when the buffer is full. 19:50:34 ais523, can't force client to flush 19:50:38 Except with newlines 19:50:41 oerjan: or there's an EOF signal 19:51:14 and only line buffering implies flushing on newlines 19:51:36 on Unices a single Control-D will flush standard input if there's at least one unflushed character in it 19:51:46 or end-of-file if all characters have been flushed 19:51:53 (and, of course, the terminal controls stdin) 19:54:05 How do I make the bf interp flush on newlines? 19:54:21 what lang is it written in? 19:54:38 I don't know, it's the interp that Ubuntu has 19:54:51 Ubuntu has two bf interps 19:55:01 the one done with command `bf` 19:55:44 * ais523 downloads its source code 19:56:18 it autoflushes after every character 19:56:24 so flushing isn't the problem 19:56:49 line 294 of bf.c, if you're interested 19:58:08 hm 19:58:13 Hiato: counters are also really easy: http://nonlogic.org/dump/images/1202500500-count.png 19:58:54 RodgerTheGreat: using cyan/black alternation as the input? 19:59:11 I think a cyan/black/cyan/black "pumping logic" could be used to create arbitrarily complex machines. The real challenge will be trying to come up with self-resetting gates 19:59:13 I seem to remember discovering that pattern as well, although I never used it for anything useful 19:59:15 yes 19:59:31 a self-resetting gate is impossible 19:59:31 is that functional? 19:59:47 because once two sections of colour have fused together by becoming the same colour, there's no way to reverse it 19:59:58 and without fusing colour sections there's no obvious way to do logic 20:00:02 PS: currently I have a mismatched, but functional winning device that works for the following config: 20:00:02 x x 20:00:02 x 20:00:19 yes, I must agree with asi523 here... 20:00:35 yeah 20:00:56 and anything more complex than two-color logic would be unfeasible from a user perspective 20:01:16 that's the exact problem I am having 20:01:29 the winning counter works once, but only once 20:01:39 then make several in parallel 20:01:40 without user intervention, I cannot reset it. 20:01:52 Hiato: just tell them to return-to-save at the end of a game 20:02:03 lol 20:02:20 then thing is: It isn't even a correct way to win 20:02:36 my rules are: if you occupy the top right spaces, you win (right angle in a row) 20:02:44 then only worry about ties and losses. :) 20:02:45 ;) 20:03:01 yeah, I was. This is for the "CPU" 20:03:21 would we call this emergent behaviour? (Out of interest) 20:04:02 * ais523 used to call it "alternative programming" 20:04:10 I call it "lifting". We're taking the logic embedded in the flood-fill tool and raising it to a level at which we can make use of it. 20:04:36 I like all of these terms ;) 20:06:57 http://filebin.ca/gonsrd/wingate.JPG 20:07:06 it's pretty much what I am using, nothing special 20:07:17 a minor variation on RodgerTheGreat's idea 20:07:20 I ran the bf cat program for PSOX successfully! 20:07:21 you could choose a better format than jpg, you know. 20:07:28 I realise :) 20:07:35 but it's not for actual testing 20:08:08 heheh. .JPG as "bitmap logic DRM" 20:08:12 Sgeo: what was wrong beforehand? 20:08:21 I still do not know, actually 20:08:40 the thing here is: Once the switch is sent through that activates one of the conditions, I still need to send one more black "pulse" to make it pass through the completed gate 20:08:42 Probably I kept messing up the BF code 20:09:14 -!- Tritonio__ has joined. 20:10:16 -!- Tritonio_ has quit (Read error: 110 (Connection timed out)). 20:10:25 this is very difficult... 20:11:36 my verdict: not practical ( :P ), but plausible. It requires such thorough planning so as to make no "wires" cross and seeing as gates are not re-usable, I cannot consider this TC ;) 20:11:57 lack of data storage implies that it's not TC 20:12:09 lack of reversibility implies it's not even bounded-storage or FSA 20:12:19 on the other hand, it may still be marginally useful for computation in some circumstances 20:13:12 lets see, how's about the term "disposable computation" :P 20:14:29 well, it definitely isn't wireworld. :/ 20:15:11 grr... I must really try to figure out what the spec for that rule-110-implementing language was 20:15:36 ok, I officially give up on the win/lose/draw signs. I'm convinced it's not possible, as besides all the aforementioned problems, you cannot make an automated even that needs more than 1 "pulse", so I can't send a win or lose through, even if the gates somehow worked without wire crossing/bleeding of gates from one to another. 20:16:17 yes, please do 20:16:22 I don't think it's not possible, but I will agree it is not a simple problem. 20:16:25 at a guess, and partly influenced from memory: 20:16:40 the cells of the program are coloured in colours 20:16:52 (the comment would seem to imply that) 20:17:05 if a R/G/B component of a cell is 0, that component can never increase 20:17:27 a cell can only change if for each colour component that is non-0 in that cell, some neighbouring cell is brighter in that component 20:17:55 and all the cells that do change set each of their components to the maximum of any neighbouring cell's component in that colour 20:17:55 RodgerTheGreat: I'm pretty darn sure that it is not possible, for the simple reason that you cannot automate the displaying of anything, as one event to complete gate, then you need another to fuse sign colours together. IE: after the user/paint has made three in a row, there needs to be one more event to trigger the signs. 20:18:33 the program is tiled across the plane infinitely, to provide the TCness 20:18:39 that sounds complicated, yet fascinating 20:18:42 and user input changes the colours somehow, to set things going 20:19:51 it's sort of like floodfill, but more interesting 20:19:53 im interested though, asi523, how would one convey a message from one place to another if, with each use, the pathway will effect it's neighbours and it will reach the end of its life soon (255,255,255) 20:19:59 I finished coding the system domain, except for mapping (which should be a2), and need just to test it 20:20:05 the tiling is infinite 20:20:20 so you start the program running at just one point on the infinite plane, and the paths go on for ever 20:20:24 but surely a given path can only be used x number of times 20:20:35 yes, but you only need to use it x number of times 20:20:51 there's a reason why the program emulates a 1D cellular automaton 20:21:00 I think it runs from top to bottom evaluating the automaton 20:21:24 aha, here comes the conundrum: if it is TC complete, then it may well never halt, but your programme will halt on the xth iteration of a specific path 20:21:25 and after a certain number of steps all cells above a certain point become irrelevant and that's the first moment that cells below a certain another point can change 20:21:35 Hiato: there are an infinite number of paths 20:22:13 I was under the impression that you had to programme this thing though (in some abstract sense, like COnway's game of life). I think I see now that it builds itself :) 20:23:17 I think though that I am still misunderstanding you... 20:23:20 of course, this is all deduction and a slight bit of memory, so some of the details may be wrong 20:23:30 maybe the only solution will be to write an interpreter and see if the program runs 20:23:42 heh :) 20:24:37 I must say, that above all else, Cellular Autonoma is probably the single most fascinating thing that I have seen yet on a computer 20:33:55 Strange that you'd misspell something that fascinating to you :P 20:34:22 lol, whoops O_o 20:34:52 anyway, asi523: this is pretty similar (well vaguely) to what you were proposing [if only just] http://en.wikipedia.org/wiki/Cyclic_cellular_automaton 20:34:54 no, Cellular Autonoma really _are_ even more fascinating. they just haven't been invented yet :D 20:35:04 lol 20:35:09 heh :D 20:35:18 typo anyone :P 20:35:35 Hiato: well you could also start spelling ais523 right... 20:35:39 http://www.codu.org/pics/displayimage.php?album=4&pos=6 // I wrote a raycaster that takes real elevation data and satellite imagery - I'm proud of it 8-D 20:36:23 blarg, it's not my night 20:37:19 Ok, the regex processor is working, the current problem is in the types 20:37:21 GregoR: impressive :D 20:37:42 binaries? 20:37:44 Hiato: that link is interesting, but seems somewhat different from my irreversible programming language 20:38:46 true, but it is vaguely reminiscent in the sense of neighbour value comparisons to determine the next state. At least that is the parallel I drew 20:39:07 Why can't this thing handle something so simple like FNUM(3) 20:39:50 Hiato: I have the source up somewhere, I'm not officially releasing anything because a friend of mine claimed he could make it 100x faster, so I gave it to him :P 20:40:05 If he does make it 100x faster, I'm turning it into a plugin for FlightGear :P 20:40:20 oh yeah, awesome. Sure, no worries :) 20:42:02 -!- ais523 has quit ("going home"). 20:43:35 -!- RedDak has joined. 20:44:50 Ok, not all of the information is being given to the type to process 20:48:57 So it isn't quite argtypes's fault 20:50:34 And the root cause of the problem: An * that didn't belong 20:50:53 At least SEEINTERNAL now shows a lot of stuff 20:51:33 Ok, now I think it's all ready woohoo 20:52:06 Should I just wrap it up in the current directory structure and add a README.txt 20:52:06 ? 20:54:25 Woohoo! 20:55:27 Here's the changeset: http://trac2.assembla.com/psox/changeset/59/ 20:56:19 Hiato, you there? 20:56:31 Yes, I am now 20:57:15 The bug I was talking about most, was send(the_func(the_domain, *argtuple)) instead of send(the_func(the_domain, argtuple)) 20:58:54 I'm not sure what you are on about, but I'll be glad to help if I can 20:59:14 a! 20:59:16 a1! 21:05:15 Ah crud. Do the .svn folders ever contain sensitive stuff? 21:05:37 Because I made a .zip archive and it included .svn 21:05:45 Or maybe I should remove them manually? 21:07:48 * Sgeo gets rid of some .svn and backup files that got in there. 21:07:54 Then... RELEASE of a1! 21:09:59 Oh, I left a test function in the system domain 21:10:01 Oh well 21:13:47 * Sgeo uploads 21:14:17 http://sgeo.diagonalfish.net/esoteric/PSOX-1.0a1.zip 21:14:22 Hiato? 21:14:33 oerjan, oklopol anyone else interested? 21:22:17 .svn doesn't contain anything sensitive, all the login data et c is contained in ~/.subversion 21:23:43 Anyone looking at the release? 21:25:07 Anyone alive? 21:25:22 RodgerTheGreat, RedDak , Hiato? 21:25:35 'sup? 21:26:07 http://sgeo.diagonalfish.net/esoteric/PSOX-1.0a1.zip 21:26:34 -!- cherez has joined. 21:26:42 Hi cherez 21:27:00 http://sgeo.diagonalfish.net/esoteric/PSOX-1.0a1.zip 21:27:34 Salutations. 21:27:49 Is ANYONE looking at it? 21:28:02 what is psox? 21:28:12 http://esolangs.org/wiki/PSOX 21:28:22 fine, I'll frickin' look at it 21:28:47 Admittedly, the code is ugly 21:30:01 so it's a protocol? where's the spec? 21:30:26 it's in the zip 21:30:30 in the spec folder 21:30:48 It's in there, as well as http://trac2.assembla.com/psox/browser/trunk/spec 21:31:03 oh, i see 21:31:07 -!- Hiato has quit (Read error: 110 (Connection timed out)). 21:31:10 it's interesting. The example BF code is pretty good. 21:31:23 RodgerTheGreat, did you run the example? 21:31:44 I also find it interesting that you support math in the PSOX API- it'd definitely come in handy for languages like INTERCAL and the like 21:31:47 Sgeo: not yet 21:32:10 the BF examples in the impl work while some example in ex doesn't work, I think 21:32:43 hm 21:43:31 * pikhq returns 21:43:35 -!- RedDak has quit (Remote closed the connection). 21:43:37 re pikhq 21:43:46 http://sgeo.diagonalfish.net/esoteric/PSOX-1.0a1.zip 21:43:59 (does not support custom domains and domains other than 0-2) 21:44:35 * pikhq is shocked 21:44:38 Actual PSOX! 21:44:46 :D 21:45:10 This weekend, I plan on working on PSOX. 21:45:31 Maybe I should have added custom domains before release 21:45:50 Although I guess I can just tell people that SVN supports custom domains once it happens 21:46:57 But I have a feeling that custom domain support would be rather simple.. 21:48:58 If you want to test writing your own domain, you can write it as a builtin for now, actually 21:49:35 You can make it builtin 3 for instance. The thing that adds in the builtins doesn't check odd or even 21:50:12 And when custom domains are implemented, they can override the builtins when a client executes the mapping function 21:52:54 Where's ehird? 21:52:59 Dunno. 21:53:19 PSOX can no longer be considered to be vaporware 21:53:22 =P 21:53:37 Sure it can. Just not truthfully. 21:57:22 Maybe I shouldn't have zipped the release up, just left it in SVN 21:58:08 Anyone interested in an alpha version would be interested in the most up-to-date version possible 22:01:03 How could such a thing POSSIBLY store body parts, or even nomod scripts for that matter... 22:01:08 erm, wrong channel 22:05:58 -!- danopia`school has quit (SendQ exceeded). 22:08:37 indeed, get the newest version of PSOX that can store body parts 22:09:01 -!- ehird`_ has joined. 22:09:34 Hi ehird`_ 22:09:43 that was fast 22:09:44 stalker 22:09:45 :) 22:10:06 Guess what you can't call vaporware anymore.. 22:10:07 http://sgeo.diagonalfish.net/esoteric/PSOX-1.0a1.zip 22:10:31 (doesn't support custom domains or domains other than 0-2 22:12:27 ehird`_, you awake? 22:12:49 ehird`_ pinged out on another network we share 22:13:21 -!- ehird__ has joined. 22:13:25 -!- danopia has joined. 22:13:30 re ehird__ 22:13:35 did you see my messages? 22:13:45 what did i miss 22:13:56 -!- ehird__ has set topic: ((lambda (f) (lambda (x) (f (lambda () (x x)))) (lambda (x) (f (lambda () (x x))))) (lambda (f) (display "THE TOPIC IS NOT ") (write (f)))). 22:14:05 Sgeo: no 22:14:12 nothing after 'its still vaporware' 22:14:13 http://sgeo.diagonalfish.net/esoteric/PSOX-1.0a1.zip 22:14:35 I never saw an 'its still vaporware' 22:15:01 i said 22:15:04 Sgeo: its still vaporware. 22:15:12 * Sgeo didn't see it 22:19:50 you know what would be cool 22:19:54 a lazy erlang/prolog hyrbid 22:19:57 *hybrid 22:19:57 serious 22:20:08 *seriously 22:23:34 also, evaluation terminates if something else 22:23:34 *fails 22:23:34 e.g. 22:23:34 foo -> #f, print("hi"). 22:23:35 "hi" will never be printed. 22:23:45 if(x,y,z) -> not(λ -> x,y,x), z. !! this would work if you didn't need the return value.. but generally you do 22:23:50 hmm 22:23:52 prettier: 22:23:54 if(x,y,z) → not(λ → x,y,x), z. 22:23:58 I <3 unicode 22:27:41 -!- ehird`_ has quit (Read error: 113 (No route to host)). 22:29:43 -!- ehird__ has quit ("K-Lined by peer"). 22:29:52 -!- ehird`_ has joined. 22:29:58 blargl 22:30:02 re ehird`_ 22:31:21 Sgeo: I wonder... 22:31:31 if(x,y,z) → not(λ → x,y,x), z. !! is it possible to make this return y or z? 22:32:09 (evaluation of the predicate terminates after the first false statement, and the whole predicate becomes false, btw.) 22:34:04 ehird`_, you have absolutely no interest in PSOX? 22:34:19 Sgeo: none, i'm afraid 22:36:59 eh 22:37:01 someone say 'foo' 22:38:17 foo 22:42:36 thanks 22:44:43 What did you need me to say "foo" for? 22:45:14 Sgeo: I will be using PSOX as an optional feature in the PEBBLE2 standard library once I get that off the ground. 22:45:26 (probably togglable via some switch like --enable-feature psox) 22:45:44 cool 22:48:16 Did you poke around the released alpha yet? 22:49:24 Not yet. 22:49:59 pikhq: You have any idea for 'if'? :P 22:54:27 if(x,y,z) → or(and(x,y),z). !! well this would work, but it depends on 'or' and 'and' ;) 22:55:25 No idea. 22:56:11 -!- oerjan has quit ("Good night"). 22:59:16 -!- puzzlet_ has joined. 23:01:14 -!- puzzlet_ has quit (Read error: 104 (Connection reset by peer)). 23:05:15 -!- puzzlet_ has joined. 23:06:45 -!- sarehu has joined. 23:12:01 -!- puzzlet has quit (Read error: 110 (Connection timed out)). 23:18:53 hey guys, I finished a new game! http://rodger.nonlogic.org/games/ICEBreaker/ 23:23:23 it's not java is it 23:24:30 ehird`_, why? It does seem to be 23:24:39 because applets :| 23:26:08 * Sgeo wonders what this unsaved change in an example BF file was.. 23:26:16 * Sgeo hopes it wasn't anything important.. 23:26:54 Hm. 23:27:10 Who wants to join the TURKEY BOMB IMPL_EMENT ATION PR_OJECT? 23:29:41 if so: #TURKEY_BOMB 23:30:35 how the hell would you implement turkey bomb? It's a drinking game! 23:30:53 RodgerTheGreat: No. 23:30:55 Read the spec. 23:30:56 It was: 23:31:09 DRINKING GAME -> PROGRAMMING LANGUAGE -> DRINKING GAME -> PROGRAMMING LANGUAGE&DRINKING GAME 23:31:19 Also, ais523 was working on one, at one point. 23:31:26 He had a trick to make it turing complete but I forget what it was 23:31:42 One thing I like about his: it used ^L page feed to seperate players 23:33:02 All programming languages are drinking games if you do it right. 23:33:11 haha 23:33:21 hmm, renamed the channel 23:33:27 #turkeyb, since we can't name the binaryTURKEY_BOMB :p 23:35:23 but it will be awesome 23:35:24 :D 23:35:38 (its option to enable turing completeness will, of course, be called TURING BOMB) 23:36:19 you can never tell whether the drinking will stop! 23:41:46 RodgerTheGreat: Hm. 23:42:01 Either I have to contain a tag in each object (interferes a bit), or I have to have first-class types. 23:42:02 Fun. 23:42:08 tag is probably the best way. 23:42:11 But then I can't say: 23:42:15 void *TURKEY_BOMB = &TURKEY_BOMB; 23:50:15 -!- Slereah has quit (Read error: 104 (Connection reset by peer)). 23:54:41 struct _TB { 23:54:41 char tag; 23:54:41 struct _TB *tb; 23:54:41 } TURKEY_BOMB[] = { { 12, (struct _TB *)TURKEY_BOMB } }; 23:54:44 it's the turkey bomb! 23:59:37 RodgerTheGreat: Hmm. ZILCH cannot be void because it needs a tag :P 23:59:50 -!- timotiis has quit ("leaving").