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