←2005-09-18 2005-09-19 2005-09-20→ ↑2005 ↑all
00:05:45 <Wildhalcyon> Glypho Fibonacci number generator: 11#[>>d<d>+<\<1-+] (Where # is a stack element that is set to the number of terms to generate)
01:01:52 -!- Sgep has quit (Remote closed the connection).
01:05:56 -!- Sgep has joined.
01:31:23 -!- Wildhalcyon has quit (Read error: 104 (Connection reset by peer)).
01:32:18 -!- Wildhalcyon has joined.
03:29:28 -!- Arrogant has joined.
03:34:40 -!- Wildhalcyon has quit (Read error: 104 (Connection reset by peer)).
03:38:48 -!- Wildhalcyon has joined.
04:06:46 -!- Wildhalcyon has quit ("Chatzilla 0.9.68.5.1 [Firefox 1.0.6/20050716]").
04:14:51 <Sgep> Be back tomorrow
04:15:27 -!- Sgep has quit.
04:35:55 -!- kipple has quit (Read error: 110 (Connection timed out)).
05:46:17 -!- CXI has quit (Read error: 145 (Connection timed out)).
05:51:30 -!- CXI has joined.
07:15:21 -!- Aardappel has joined.
07:15:37 * Aardappel tickles cpressey
07:16:49 <Arrogant> Adding a stack to this thing was a great success
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
08:35:29 -!- Arrogant has quit (" HydraIRC -> http://www.hydrairc.com <- IRC with a difference").
10:29:56 -!- CXI has quit (Read error: 104 (Connection reset by peer)).
10:30:11 -!- CXI has joined.
11:40:40 -!- grim__ has joined.
11:48:46 -!- ChanServ has quit (Shutting Down).
11:51:09 -!- ChanServ has joined.
11:51:09 -!- irc.freenode.net has set channel mode: +o ChanServ.
11:53:36 -!- grim__ has changed nick to grim_.
12:00:09 -!- grim_ has left (?).
13:22:50 -!- jix has joined.
13:23:06 <jix> moin!
13:25:10 <jix> np: Kyuss - Supa Scoopa and Mighty Scoop [ Welcome To Sky Valley ]
13:39:04 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht").
14:08:55 -!- jix has joined.
14:11:05 -!- kipple has joined.
14:28:42 -!- jix has quit (Read error: 110 (Connection timed out)).
15:37:15 -!- ihope has joined.
15:39:41 <ihope> There, I just executed an IRP instruction: NOP
15:48:27 -!- Wildhalcyon has joined.
15:49:15 <Wildhalcyon> hey all
16:20:07 -!- grim_ has joined.
16:35:54 <Wildhalcyon> mornin' grim
16:39:50 <grim_> wotcha
16:48:45 <Wildhalcyon> nada
17:08:56 -!- jix has joined.
17:09:21 <jix> moin
17:09:23 <jix> again
17:11:09 <Wildhalcyon> moin!
17:11:21 <Wildhalcyon> Im sorry Jix :-(
17:12:32 <Wildhalcyon> The previous incarnation of Glypho was too tarpit for me, Ive had to make some changes. I might be making some additional ones soon as well.
17:18:27 <grim_> wh: which one are you talking about?
17:18:35 <grim_> the [...] braces one?
17:18:43 <grim_> or the one before?
17:18:49 <Wildhalcyon> the [] one
17:18:53 <grim_> hehehe
17:19:05 <Wildhalcyon> Yeah, grim understands me
17:19:57 <Wildhalcyon> I've thought about modifying the arithmetic to be more "brainfuckish" - push-1 becomes push-0, add becomes increment, negate becomes decrement.. and multiply disappears (leaving me with an additional instruction)
17:20:16 <jix> :(
17:20:23 <jix> that's too brainfuckish imo
17:20:24 <kipple> why?
17:20:48 <kipple> that was a response to WildHalcyon, not jix, btw
17:20:52 <Wildhalcyon> You're right, but it makes numbers easier
17:21:07 <grim_> well...
17:21:20 <Wildhalcyon> It also makes more sense from the point of view of the "push" function - pushing an empty cell, ready to accept input
17:21:32 <jix> Wildhalcyon: no you can create every number in the form 2^a+2^b+2^c => 1d+d+d+...1d+d+d+...1d+d+d+..+++...
17:22:44 <Wildhalcyon> I suppose that is easier than the BF "add til' you get there" number functions
17:23:07 <Wildhalcyon> Jix, did you read about the reasoning behind adding the brackets?
17:23:51 <kipple> I think the brackets are good. The main brainburner will be having only a stack anyways
17:24:01 <grim_> you can already do bf-ish 111111+++++
17:24:02 <Wildhalcyon> Plus, I like how pushing 0 becomes: 11-+
17:25:42 <Wildhalcyon> I think you can also perform BF multiplication by doing 111++-1>[<11++>1+] which should multiply 2*3?
17:26:46 <grim_> yes, where is the problem?
17:27:24 <Wildhalcyon> I don't know, really. Im being wishy-washy I suppose. Glypho is good, I am happy with its creation
17:27:49 <Wildhalcyon> Next step is to create a program that takes glypho "shorthand" and converts it to a symbol string
17:28:22 <Wildhalcyon> preferably not just a static aabbabbaabcaabab etc. but one that used multiple symbols from an alphabetic set
17:29:26 <grim_> true
17:29:34 <grim_> shouldn't be hard either
17:29:51 <grim_> but I've work to do :(
17:29:56 <kipple> btwm shouldn't the [ and ] patterns be opposites?
17:30:06 <Wildhalcyon> not really, not with a decent PRNG, and I have work to do this week too
17:30:13 <Wildhalcyon> probably kipple
17:30:35 <Wildhalcyon> I only swapped out "skip" and "test" with "[" and "]"
17:31:43 -!- J|x has joined.
17:36:38 <Wildhalcyon> Kipple, I fixed it
17:37:20 <Wildhalcyon> and I've written a few example functions - fibonacci and cat
17:39:03 -!- jix has quit (Nick collision from services.).
17:39:05 -!- J|x has changed nick to jix.
17:39:24 <kipple> cat is nice and short :)
17:39:36 <Wildhalcyon> and aside from swapping symbols with bf, its identical
17:40:42 <kipple> what happens if you start a program with a [ ?
17:40:50 <kipple> is that an error?
17:41:11 <jix> if it pops.. yes
17:41:31 <jix> how does [ work exactly ?
17:41:31 <kipple> [ doesn't pop, I think. only peek
17:41:47 <jix> ok.. if it peeks a negative value does it loop forever?
17:41:59 <kipple> but what happens when you pop or peek at an empty stack?
17:42:09 <jix> error
17:45:52 <Wildhalcyon> popping an empty stack is no good
17:45:56 <Wildhalcyon> Don't do it
17:46:22 <kipple> hehe. sure. just couldn't find anything about it in the spec...
17:46:55 <kipple> ah. found it. but it says it is NOT an error
17:47:18 <Wildhalcyon> Oh, well.. see?
17:47:20 <kipple> jix: "popping from an empty stack is a NOP"
17:47:21 <Wildhalcyon> Very ambiguous
17:47:46 * Wildhalcyon was unfortunately tired and ambiguous last night during the creation of Glypho
17:48:21 <kipple> now that you have an instruction that peeks, it is even more unclear :D
17:49:19 <Wildhalcyon> I know :-(
17:49:50 <kipple> the simple solution is of course to invoke the old "undefined behavior"
17:50:59 <Wildhalcyon> ah... ambiguous behavior wrapped inside a wonderful ambiguous statement
17:52:20 -!- J|x has joined.
17:53:53 <Wildhalcyon> "Any actions which pop or otherwise manipulate the stack while it is empty have an undefined behavior and should be frowned upon at all times"
17:53:58 <Wildhalcyon> How's that sound?
17:54:09 <kipple> that's nice :)
17:54:56 <Wildhalcyon> I wonder how trivial it is to prove that this language is TC...
17:55:35 <kipple> hmm. manipulating the stack would include pushing... and you'll want to push to an ampty stack ;)
17:55:52 <lindi-> Wildhalcyon: relatively trivial, just show that you can emulate a turing machine
17:56:19 <Wildhalcyon> good point kipple, pushing is important
17:57:37 <Wildhalcyon> That's what I thought lindi. I think I can emulate one, I just have to demonstrate it. I've proved it can loop, I guess I should prove it can have an arbitrary-length tape
17:58:54 <lindi-> Wildhalcyon: that's actually depends on how you define turing completeness. if you absolutely require infinite tape then very few languages support that
17:59:23 <Wildhalcyon> Well, TC never said inifinite tape - just long enough to do whatever job you wanted to do with it.
17:59:41 <lindi-> i thought it said infinite tape, wait a sec. i'll check
17:59:41 <kipple> strictly speaking TC requires an infinite tape
17:59:59 <kipple> I think the definition of a Turing machine includes an infinite tape
18:00:04 <Wildhalcyon> I was under the assumption that TC just required a tape that could be ANY length
18:00:19 <lindi-> indeed. in computability theory sense
18:00:22 <kipple> but the stack in Glyph is infinite, so I don't think that's a problem
18:00:36 <lindi-> "While such machines may be physically impossible as they require unlimited storage, Turing completeness is often loosely attributed to physical machines or programming languages that would be universal if they had indefinitely enlargeable storage. "
18:00:43 <Wildhalcyon> in fact, any task which REQUIRES infinite tape is not computable on a turing machine
18:00:43 <lindi-> kipple: stack isn't a tape
18:00:49 <kipple> I know
18:01:08 <Wildhalcyon> lindi, my stack can be modeled as a piece of tape with the ends tied together
18:01:08 <lindi-> so, you can still make it "loosely TC"
18:01:18 <lindi-> that's not stack anymore then
18:01:34 <Wildhalcyon> Well then, no. Its not a stack. Its a circular linked list
18:01:42 <lindi-> yep
18:01:48 <Wildhalcyon> But pushing and popping are done on a stack-like basis
18:01:51 -!- jix has quit (Read error: 110 (Connection timed out)).
18:02:05 <lindi-> Wildhalcyon: is the spec online somewhere?
18:02:14 <Wildhalcyon> The fact that sometimes it enqueues its head onto its tail is... crazy
18:02:23 <Wildhalcyon> www4.ncsu.edu/~bcthomp2/glypho.txt
18:02:59 <Wildhalcyon> I think I'll nickname the stack-list monstrosity as "ouroborous" (sp?) since it eats its own tail
18:05:03 <Wildhalcyon> Some people Ive shown it to have trouble understanding how the symbols within the instructions work. I've had trouble explaining it.
18:05:39 <kipple> I can imagine
18:05:48 <grim_> what have they found difficult? the whole context-free wxyz thing?
18:06:00 <kipple> I had some troubles with it myself at first :)
18:06:21 <Wildhalcyon> Mostly the fact that the "a" for instruction 1 does not necessarily equal the "a" for any other instruction
18:06:37 <grim_> right, sure
18:06:52 <kipple> you might want to use other symbols than letters
18:07:03 <kipple> though I'm not sure which
18:07:10 <lindi-> Wildhalcyon: in fact, i'm not sure if glypho is tc or not
18:07:21 <Wildhalcyon> why not lindi?
18:07:49 <lindi-> i'm just unsure :)
18:08:00 <Wildhalcyon> I can understand that I guess.
18:08:38 <Wildhalcyon> We'll find out. I'll work on trying to implement bf instructions in it
18:09:25 <grim_> it seems to me that you can get TC-ness with a couple of bits of string and some PVA glue these days
18:10:06 <Wildhalcyon> tell me about it grim. I'll be pretty peeved if wang tiles can out-TC my glypho language
18:45:49 -!- pgimeno has changed nick to pg_coche.
18:47:17 <Wildhalcyon> Hmm, I can't find the sequence {1,2,5,15,50...} in the integer sequence database
18:47:58 <Wildhalcyon> Although its possible I counted wrong on n=6 :-(
18:57:50 -!- ihope has quit ("Chatzilla 0.9.68.5 [Firefox 1.0.6/20050716]").
19:10:34 <Wildhalcyon> Found it - I did count wrong
19:11:14 <Wildhalcyon> "Word structures of length n using a 6-ary alphabet. Permuting the alphabet will not change a word structure. Thus aabc and bbca have the same structure."
19:12:24 -!- J|x has changed nick to jix.
19:12:45 <kipple> are you having an identity crisis today jix? ;)
19:13:54 <jix> no... a bad network connection
19:16:01 -!- pg_coche has changed nick to pgimeno.
20:19:50 * jix is going to continue coding his homepage
20:26:15 <jix> np: Metallica - Am I Evil (bonus track) [ Kill 'Em All ]
20:30:00 <jix> am i evil -- yes i am ..
20:42:04 <jix> np: Metallica - Anesthesia (Pulling Teeth) [ Kill 'Em All ]
20:52:31 <Wildhalcyon> gotta go to work, be back in a few...
20:53:49 <kipple> hmm. is there an esolang based on pirate lingo? http://ldc.upenn.edu/myl/llog/piratekeyboard.jpg
20:54:09 <jix> LOL
21:17:38 <jix> gn8
21:17:38 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht").
21:38:43 -!- Aardappel has quit ("http://strlen.com/").
22:18:19 -!- Sgep has joined.
22:37:53 <grim_> lo all
22:38:14 <grim_> 18:35 < Wildhalcyon> Hmm, I can't find the sequence {1,2,5,15,50...} in the integer sequence database
22:38:29 <grim_> there's an integer sequence database?
22:43:18 <Sgep> Any comments on http://esolangs.org/wiki/User:Sgeo/binbf
22:45:30 * Sgep goes to clarify something
22:53:05 <Sgep> Any comments/
22:56:24 <grim_> not from me
22:58:33 <grim_> do you have an implementation?
22:59:30 <Sgep> No
23:12:24 * Sgep might write an implementation right up to the point before the Huffman encoding is actually done
23:12:29 <Sgep> Not now though
←2005-09-18 2005-09-19 2005-09-20→ ↑2005 ↑all