00:10:02 -!- GregorR-L has quit (Read error: 113 (No route to host)).
00:27:26 -!- GregorR has quit (Remote closed the connection).
00:27:56 -!- CXI has quit (Connection timed out).
00:27:59 -!- GregorR has joined.
00:47:28 -!- GregorR has quit (Read error: 104 (Connection reset by peer)).
00:48:02 -!- GregorR has joined.
02:37:23 <i|> Okay.
02:38:05 <i|> A = B^2 - C^2 for nonnegative integers B and C if and only if A mod 4 /= 1.
02:40:47 <i|> Let's grab a number out of thin air, then...
02:41:16 <i|> So our number is 18723.
02:42:25 <i|> 18723 / 3 = 6241.
02:42:25 -!- GregorR has quit (Remote closed the connection).
02:42:57 -!- GregorR has joined.
02:43:34 <i|> Because I'm lazy, I guess I'll use this heavy duty prime thingy.
02:44:54 <i|> Who would have guessed? 18723 = 3 * 79 * 79.
02:46:42 <i|> So 18723 = 79 * 237.
02:47:40 <i|> The average of these is 158 and the distance from the average to each number is 79.
02:48:14 <i|> Therefore 18723 = (158 - 79)(158 + 79) = (158^2 - 79^2).
03:10:03 -!- int-e has joined.
03:10:23 <i|> I don't think IDTIIASDA is a self-dependent acronym.
03:11:12 -!- i| has changed nick to ihope.
03:11:34 <lament> nice one
03:12:19 <ihope> You know, I'd like the NICK command to have a message thing associated with it.
03:12:37 <ihope> Like /nick ihope It's not easy being i|.
03:27:25 -!- kipple has quit (Read error: 110 (Connection timed out)).
03:46:57 -!- CXI has joined.
03:59:50 <ihope> Hmm, Haskell's readsPrec is nice. Let's see here...
04:02:08 <ihope> readsPrec _ ('`':xs) = do {(func, interm) <- readsPrec 0 xs; (param, remains) <- readsPrec 0 interm; return (apply func param, remains)}
04:02:52 <ihope> readsPrec _ ('.':c:xs) = [(output c, xs)]
04:02:57 <ihope> Etc. etc.
04:17:14 -!- ihope has quit ("GHC, NHC, YHC... what's the world coming to?").
05:32:22 -!- Sgeo has quit (Read error: 104 (Connection reset by peer)).
06:29:39 -!- int-e has quit ("Bye!").
06:33:32 -!- GregorR has quit (Read error: 110 (Connection timed out)).
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
08:06:59 -!- CXI has quit (Connection timed out).
10:40:43 -!- kipple has joined.
11:09:07 -!- jix has joined.
12:42:59 <SimonRC> hi
14:42:07 -!- kipple has quit (Read error: 110 (Connection timed out)).
16:29:09 * SimonRC thinks of a cunning plan to get free photocopying credits.
16:29:28 <SimonRC> Create poster with this hidden on it: http://en.wikipedia.org/wiki/EURion_constellation
16:29:56 <SimonRC> Complain insanely when photocopying shop won't copy it for you.
16:30:14 <SimonRC> Get given free photocopying credits as compesation.
16:30:19 <SimonRC> ..
16:30:20 <SimonRC> .
16:30:22 <SimonRC> ???
16:30:24 <SimonRC> Profit!
16:39:40 <lament> ....
16:39:56 <lament> better yet
16:40:01 <lament> sue the shop if they do manage to photocopy it
16:43:04 <SimonRC> why?
16:45:17 <lament> you could claim they're secretly counterfeiting money or something
17:16:38 -!- twobitsprite has joined.
17:17:37 <twobitsprite> does anyone know if the linuyux program "dc" is turing complete or not? It's only form of flow control that I see is the ability to execute macros dependant on the comparison of numbers..
17:18:10 <twobitsprite> linux*
17:29:19 <SimonRC> can macros be recursive?
17:30:16 <SimonRC> actually, three infinite-precision integers are turing-complete, if you have +_*/%
17:30:54 <SimonRC> you can use them as a turing machine tape, as long as you can repeat operations
17:48:24 <jix> SimonRC: one if you have * / and %
18:22:58 <twobitsprite> wow... I didn't know that
18:24:01 <twobitsprite> and yes, I think you can pull off recursive macros because macros exist on the stack, and dc has a duplicate operation, so when calling a macro you can dup it first, call it, and the macro can then dup-call itself...
18:24:54 <SimonRC> ITYM write a y operator.
18:25:05 <twobitsprite> ITYM?
18:25:24 <twobitsprite> (I can't seem to keep up with IRC lingo no matter how much time I spend on here... :P)
18:29:40 * SimonRC eats food
18:30:40 <twobitsprite> maybe I'll trying writing a bf compiler which targets dc...
18:31:15 <SimonRC> http://en.wikipedia.org/wiki/List_of_Internet_slang
18:31:37 <SimonRC> 2 big numbers are a pair of stacks.
18:32:08 <SimonRC> pop is: N->(N/256,N%256)
18:32:39 <SimonRC> push is: (N,x)->(256*N+x)
18:33:04 <SimonRC> each bignum is a stack, and two stacks make a turing machine tape.
18:33:08 * SimonRC goes
20:40:02 -!- calamari has joined.
20:44:16 <calamari> hello
21:20:01 -!- Sgeo has joined.