00:08:49 -!- RedDak has joined. 00:44:57 -!- RedDak has quit (Remote closed the connection). 00:47:15 -!- RedDak has joined. 01:16:15 -!- Slereah has joined. 01:18:36 -!- RedDak has quit (Remote closed the connection). 01:21:00 -!- RedDak has joined. 01:33:48 -!- Slereah- has quit (Read error: 110 (Connection timed out)). 01:34:42 -!- Slereah- has joined. 01:37:07 -!- RedDak has quit (Remote closed the connection). 01:41:13 -!- Slereah has quit (Read error: 110 (Connection timed out)). 02:13:31 -!- Slereah has joined. 02:29:55 -!- faxathisia has joined. 02:31:28 -!- Slereah- has quit (Read error: 110 (Connection timed out)). 04:57:03 -!- oerjan has joined. 05:29:19 Hello, oerjan. 05:29:47 -- Champion, Minister Without Portfolio, Ambassador, Scorekeepor, and Agoran Spy pikhq. 05:30:53 so a Minister Without Portfolio with two portfolios on the side? 05:31:07 LMAO 05:31:22 Yeah, the Minister Without Portfolio laws are kinda. . . Weird. 05:31:35 Basically, the last 4 winners are Ministers Without Portfolio. 05:31:55 Inevitably, the people who win are involved in Agora, and so are probably officers. 05:32:02 initial > obligatory 05:32:31 Um. . . 05:32:38 * oerjan briefly entertains the idea of pretending that was _not_ on the wrong channel 05:33:06 :p 05:33:57 * pikhq is amused by how currencies can be created by their recordkeepors by announcement. . . 05:36:30 * oerjan recalls the Euclid currency he was recordkeepor for. It was counted in multiples of pi... 05:36:39 LMAO 05:36:56 I can create any number of points in my posession. Fun stuff. 06:05:55 sup bitches 06:06:10 クリスマスと思う。 06:11:12 -!- DocWilco has left (?). 06:54:11 could have a programming language with regex as the type system ? 07:04:42 I dunno. 07:05:10 I do know that there is a programming language implemented via bytecode compilation with the compiler in bytecode, though. 07:05:52 faxathisia, actually, PSOX, even though it isn't a programming language, might end up using regexes to define types 07:06:37 Said language seems to have its types implemented within a subset of itself. 07:06:50 Mmm. Plof. 07:07:31 Although I must wonder: why is function application an overloadable operator? :p 07:10:35 Sgeo lol :D 07:10:40 PSOX's type system: http://trac2.assembla.com/psox/browser/trunk/spec/psox-types.txt 07:10:54 * Sgeo really dislikes the thought of using Regex, but doesn't have any better ideas 07:11:07 hm.. Plof 07:11:28 It's a good language. . . 07:11:39 The implementation of it so far is insane. Brilliant, but insane. 07:11:51 opFunction = opFunction(opFunction); kinda sums it up. 07:12:10 I never heard about Plof 07:12:25 It's Gregor's plaything. . . 07:12:30 oooohhhhh 07:12:33 I think I know it 07:33:34 * Sgeo works out how to do PSOX safety -- the user gives the PSOX interpreter a switch to determine whether or not File I/O should be sandboxed.. 07:36:10 G'night all 07:36:26 -!- Sgeo has quit (Client Quit). 07:37:27 hehe 07:37:28 r"((?:\x01" + some_type_regex + r")*?\x00)" 07:37:29 dependant types 07:37:36 this is neat 07:46:49 yes! 07:47:07 i mean, general positive attitude 07:47:29 and merry christmas 07:47:45 happy tuesday 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:44:10 if I have a program of size N it's capable of computing an object of size O(N^2) :S 08:44:27 I guess it's more like O(something massive).. ? 08:44:54 there are space complexity classes too 08:45:28 I'm not even sure how to describe what I'm asking 08:45:31 is it clear what I meant? 08:45:40 no 08:46:28 if we are talking a turing complete language here... 08:46:53 oh there would be no bound on the length of what it computes based on the program size 08:46:58 then something massive is possible, yes 08:47:05 no computable bound 08:47:19 if there were, you could use it to solve the halting problem 08:48:25 well, assuming the language has reasonable power to construct things 08:48:58 since languages that only return yes/no answers can be considered turing-complete 08:49:19 ohh 08:49:42 in that case, a better question is.... What's the biggest term/number you can compute in a program with size <= x 08:50:16 er in that case the answer is: a boolean :) 08:50:25 not in that language :p 08:50:46 I think some people did this with C, where the int type has arbitrary precision 08:51:02 but if we assume that your language can compute objects of the same size as its number of steps... 08:51:34 then it becomes essentially the question of number of steps, so the halting problem 08:52:11 and your answer is a busy beaver function 08:55:09 why busy beaver? 08:57:56 http://en.wikipedia.org/wiki/Busy_beaver 08:58:39 oh I see 08:58:52 It's just that, anything which does well at this task is a busy beaver by definition 08:59:08 I was assuming busy beaver was a certain algorithm 10:36:05 -!- Slereah- has joined. 10:41:34 -!- jix has joined. 10:59:32 -!- Slereah has quit (Read error: 110 (Connection timed out)). 11:01:05 -!- Slereah- has quit (Read error: 110 (Connection timed out)). 11:16:25 -!- RedDak has joined. 11:33:52 -!- Slereah- has joined. 11:41:39 -!- RedDak has quit (Remote closed the connection). 11:44:34 -!- jix has quit ("CommandQ"). 11:47:49 -!- jix has joined. 14:37:48 -!- Slereah has joined. 14:52:24 -!- Slereah- has quit (Read error: 110 (Connection timed out)). 15:46:49 -!- sebbu2 has joined. 15:52:32 -!- sebbu3 has joined. 15:54:39 -!- puzzlet has quit (Remote closed the connection). 15:54:46 -!- puzzlet has joined. 15:55:00 -!- sebbu has quit (Read error: 110 (Connection timed out)). 16:08:40 -!- sebbu2 has quit (Read error: 110 (Connection timed out)). 16:37:52 -!- RedDak has joined. 16:58:27 -!- oerjan has quit ("leaving"). 17:57:22 -!- lewiji has joined. 18:18:09 -!- lewiji has quit. 20:57:38 -!- jix has quit (Nick collision from services.). 20:57:48 -!- jix has joined. 21:37:50 -!- RedDak has quit (Read error: 113 (No route to host)). 22:03:57 -!- sebbu3 has changed nick to sebbu. 22:52:14 -!- faxathisia has quit ("Leaving"). 23:53:23 -!- jix has quit ("CommandQ").