00:29:26 c u in a week or so 00:29:28 -!- andreou has quit. 00:37:35 What was the rewriting language where rules could be rewritten? 00:38:15 Um... Can you be more specific? 00:38:30 do you know any languages like that? :) 00:38:50 the same basic idea as thue 00:38:58 Was it... 2d? 00:39:07 i think so. 00:40:08 it was kinda weird and complicated, though. 00:40:23 Hmm... I think Chris Pressey did a 2d rewriting language... 00:40:32 Of course, catseye seems to be down at the moment. 00:43:46 I remember not liking that language, though 00:43:51 (unlike thue) 00:44:15 It wasn't as nifty. 00:44:51 yes 00:45:00 but the _idea_ of rules rewriting rules is nifty. 00:45:01 I stumbled across a 3d version of a Thue-ish language... A Japanese program... Someone had implemented space invaders in it :) 00:45:10 whoa. 00:46:04 I also found a paper that mentioned a 2d version. I would have preferred that one, but it wasn't available anywhere. 00:47:09 Why don't you design a rule-rewriting Thueoid? :) 00:48:05 I'm not sure how to design one. 00:48:13 A 2d thue would'nt be hard to do 00:48:29 I assume substitutions preserve the size? 00:48:44 Yes. They did in the Japanese program. 00:48:54 that spoils some of the fun 00:49:01 also i'm not sure how it would do IO 00:49:22 I seem to recall there being more than just the analog of the Thue ::= mapping. 00:49:34 but that sucks :) 00:50:02 I think it may have had AND gates, or some similar concept... Rewritings that depended on more than one pattern being present. 00:50:10 oh. 00:50:24 bah. 00:50:40 This is just my hazy recollection, though. 00:51:07 A self-modifying thue without the 2d evilness would be neat, though 00:54:20 Found it! 00:54:22 Visulan. 00:54:27 http://www.yuasa.kuis.kyoto-u.ac.jp/ylab/yamakaku/Dms96/dms96.html 00:55:46 It's cute :) 00:56:26 * Taaus wanders off to watch The West Wing. 00:56:46 oh, wow 00:56:48 very cute. 00:56:51 But not really thue 00:56:53 ish 00:57:21 well, i guess it is 00:57:29 anyway, ew windows :) 01:00:34 oh err 01:00:42 ah. 01:00:56 2d thue is too much like cellular automata. 01:01:06 and therefore not very exciting! 01:15:42 -!- lament has quit ("leaving"). 04:27:23 -!- dbc has joined. 04:28:16 I thought the Thue example programs were a mess. Increment should be something like: 04:28:16 0_::=1 04:28:16 1_::=_0 04:28:16 __::=_1 04:28:16 ::= 04:28:43 and decrement should be something like: 04:28:44 0_::=_1 04:28:44 1_::=0 04:28:44 _0::=_ 04:28:44 ::= 05:20:52 -!- dbc has quit ("You have no chance to survive make your time."). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 17:44:58 -!- lament has joined. 17:46:02 dbc: neat 17:48:17 I wrote a visual thue interpreter at home. 17:48:26 It highlights the substitutions. 17:48:47 But I don't have internet, so I can't show it to anyone! You'll just have to trust me! Mwahaha. 18:59:30 hm, how do you write quines 20:32:36 -!- lament has quit ("leaving"). 22:06:37 -!- lament has joined. 22:21:54 wee 22:22:00 i'm writing a thue interpreter in Javascript 22:22:16 Nice. 22:22:40 it will be visual 22:23:37 Oh, joy. 22:27:54 well, not very visual 22:28:17 Oh, not so much joy, then. 22:32:42 :( 22:32:51 Joy sucks anyway 22:33:04 forth is neater 22:33:37 Haha.. 22:38:25 i'm serious! 22:38:28 well, not really