00:02:09 -!- timotiis has quit ("leaving").
00:53:32 -!- ihope has joined.
00:55:37 -!- ihope has set topic: THIS IS "NOT" THE END OF THE INTERNET..
00:55:51 <ihope> Interpret that however you wish.
01:09:32 -!- lament has set topic: THIS IS "NOT" THE END OF THE INTERNET. NOT..
01:10:20 -!- ehird` has set topic: let consume = id; internet = case internet of (x:xs) -> consume x : internet xs in not (null internet).
01:10:40 -!- ehird` has set topic: let consume = id; internet = case internet of (x:xs) -> consume x : internet in not (null internet).
01:11:38 <ehird`> oerjan: haskell should so solve the halting problem to report <<LOOP>>
01:13:19 <ehird`> perl -wlne'END{print$n}eof&&$n++;/<title>([^<]+)/i&&$n--' *
01:13:22 <ehird`> what does that ACTUALLY do?
01:13:55 <ihope> I imagine it... um, does nothing? :-P
01:15:28 -!- puzzlet has quit (Read error: 104 (Connection reset by peer)).
01:15:39 -!- Corun has quit (Read error: 110 (Connection timed out)).
01:16:32 -!- puzzlet has joined.
01:16:43 <ehird`> btw -- http://esolangs.org/wiki/User_talk:Oerjan <-- Someone ought to tell GreaseMonkey that his terms are among the most draconian of all the licenses (I would hesitate to call it 'free' very much). He even has a section on his userpage about how evil oerjan is and how the world is cruel and he had to remove the page
01:17:28 <ehird`> hm, he phrases it wrong there
01:17:34 <ehird`> it was far more draconian than what he has there
01:17:46 <oerjan> i think it does something like counting the number of files minus the number of lines matching <title>([^<]+)
01:18:05 <oerjan> then printing the count at the end
01:21:11 * pikhq wonders if Razor-X/Sukoshi has been in the channel recently
01:21:58 <oerjan> i am not sure i've seen her since the autumn
01:22:15 <oerjan> and only a short visit at that
01:27:50 <ehird`> i only ever saw her once or twice.
01:27:57 <ehird`> {C[(c__)x1=][ix*(0)(_a)A!(_a)a.?=^]}
01:28:00 <ehird`> glass accumulator generator
01:29:16 <ehird`> {C[(c__)x1=][ix*(0)(_a)A!(_a)a.?=^]}
01:29:16 <ehird`> {M[m(_c)C!(_o)O!(_c)i.?(_c)i.?(_o)(on).?]}
01:32:34 <ehird`> {C[(c__)1x=][ix*(_a)A!(_a)a.?=x*^]}
01:32:58 <ehird`> or {C[(c__)1x=][ix*(_a)A!(_a)a.?x=x*^]}
01:37:18 <ehird`> what is t he most effective FYB?
01:39:10 <ehird`> isn't the simplest just loads of padding, then find the first char outside a loop and bomb, if at end of program just add a bomb?
01:39:29 * oerjan doesn't know but would hope there is at least a paper-rock-scissors type of interaction, with no absolute winner
01:40:56 <ehird`> you know what would be interesting
01:40:59 <ehird`> a befunge fuckyourbrane
01:41:09 <ehird`> with an extra command that is just like p and q but on the opponent
01:41:15 <ehird`> or maybe make p and q operate on the opponent
01:41:37 <ihope> Or make the programs share one field.
01:42:15 <ehird`> That could be confusing.
01:42:32 <ehird`> (I mean Befunge-93, of course. 98 is just crazy.)
01:42:42 <ehird`> (Well, 93+infinite-playing-field. I think that's the sanest funge.)
01:43:16 <ihope> You know, I did slightly ponder a somewhat FYB-like thing once: a huge array is filled with random BF instructions, and a number of instruction pointers execute it, and the code is the memory.
01:43:58 <ehird`> having all ps and qs operate on the other program would be interesting
01:44:07 <ehird`> if you want to store data you'd have to find an empty space on their program
01:44:13 <oerjan> ehird`: not infinite, how can you ever hit your opponent then :D
01:44:23 <ehird`> oerjan: board is loaded at 0,0
01:44:26 <ehird`> and extends to +inf,+inf
01:44:48 <ehird`> and maybe starting whitespace is ignored.
01:44:52 <ehird`> to avoid trivial cheats
01:45:24 <oerjan> ehird`: that would allow a strategy of fleeing away from 0,0 in an unpredictable direction at great speed?
01:45:39 <ehird`> oerjan: oh, good point
01:45:49 <ehird`> OK, but how can you utilize turing completeness then?
01:46:00 <ehird`> I guess board=progsz+some
01:46:49 <ehird`> oerjan: because 80x24 is probably not enough for most bombers
01:48:36 <ehird`> oerjan: how about - instead of using p and q, you have two pointers
01:48:42 <ehird`> a pointer in your program that does the execution stuff
01:48:52 <ehird`> and a pointer in the other that you can move about, get current value, and set current valu
01:50:36 <oerjan> i think opinions are overrated, and no one should have them EVER
01:51:49 <oerjan> depends how quickly you can move the pointers
01:53:12 <oerjan> i am reminded of redcode's lack of absolute addressing
01:55:27 <ehird`> so i guess p and g + manual counting would be better
01:56:06 <oerjan> i am not saying relative addressing is a bad thing
01:58:08 -!- olsner has quit ("Leaving").
02:05:34 <ehird`> with p and g operating only on the current ptr
02:06:24 <oerjan> so you don't want to allow rapid bombing?
02:07:36 <ehird`> i'll discuss this further tomorrow, have to go now
02:07:44 <ehird`> if you come up with any more ideas just tell me and i'll se the logs tomorro
02:07:51 -!- ehird` has quit ("K-Lined by peer").
02:13:44 <slereah_> Finite state automaton is from the 70's :o
02:14:32 <pikhq> Yes, and Turing machines are from the 30s. Your point?
02:15:01 <pikhq> faxathisia: Lambda calculus is also from the 30s.
02:15:08 <pikhq> Same year as the Turing machine, IIRC.
02:15:24 <pikhq> RodgerTheGreat: I'm the Antiartist; no.
02:16:52 <slereah_> Compared to the whole turing machine shenanigans.
02:19:37 <pikhq> The whole thing about any Turing-complete system being able to compute what any other such system can?
02:19:42 <pikhq> That is the Church-Turing thesis. . .
02:19:55 <pikhq> Church devised Lambda calculus, Turing the Turing machine. . .
02:20:03 <pikhq> And both came to the same conclusion. ;)
02:21:38 <pikhq> Church's paper on the Halting problem came out in April 36. . .
02:21:44 <pikhq> Turing's in May 36.
02:21:47 <pikhq> s/Halting/halting/
02:23:15 <lament> there're only 30 days in april and 31 in may.
02:23:30 <RodgerTheGreat> I want to create a new CS case study called "The Halting Salesman Problem"
02:25:58 <oerjan> well that certainly is impossible.
02:26:38 <pikhq> Don't argue with oerjan until you get published in one of the AMS's journals. :p
02:28:58 <pikhq> (I assume you wrote this? http://www.ams.org/tran/2006-358-06/S0002-9947-06-03843-8/home.html)
02:30:36 <RodgerTheGreat> I don't know much about the case-study, but I think it involves a turing machine that is also a traveling salesman.
02:31:04 <ihope> Given an arrangement of cities described by a predicate on a pair of integers, if a salesman has to visit each one, determine whether or not the salesman ever halts.
02:31:07 <pikhq> BTW, I congratulate you on getting into the Transactions
02:35:26 <pikhq> Transactions of the American Mathematical Society.
02:35:53 * Sgeo looks at the link, and gives up any hope of understanding
02:36:14 <pikhq> I'm sure I'll understand it a bit more in a few years.
02:36:30 <pikhq> (I'm majoring in computer science *and* mathematics)
02:37:13 <Sgeo> I mean, I knew the basics of Calculus in 6th grade, and seeing stuff I don't understand (although that's everyday in this channel) isn't doing me any good
03:13:26 -!- ihope_ has joined.
03:20:14 <RodgerTheGreat> http://rodger.nonlogic.org/dump/images/1203045422-think.png
03:22:14 -!- ihope__ has joined.
03:24:26 <ihope__> Well, I liked the main content better than the stuff written around the edges.
03:25:02 <ihope__> It reminds me of lucid dreaming, and the second to last panel reminds me of... something else.
03:25:23 <ihope__> Probably something from one of these recent Neopets comics. :-P
03:25:36 <oerjan> I thought the paper had a nice, dry flavor although it could use a little more seasoning.
03:28:16 <RodgerTheGreat> oerjan: I've experimented with adding cilantro, but people tell me it adds too much bite
03:28:51 <ihope__> Oh, and it reminds me of 1/0, too.
03:30:24 <ihope__> A comic strip with a primitive world, a nice amount of philosophy, and lots of sand.
03:30:45 <ihope__> It might be fun to try my hand at doing my own "version" of your comic.
03:30:51 -!- ihope has quit (Read error: 110 (Connection timed out)).
03:31:20 <ihope__> But I generally don't draw, so it might be... oh, I think I'll do it.
03:31:48 <oerjan> built it with lego. seems to be all the rage.
03:32:18 <ihope__> (I'd slap you, oerjan, but that would be mean.)
03:32:25 <ihope__> Yes, I'm thinking about it now.
03:33:02 <RodgerTheGreat> I just kinda started with a rough idea "I change things." and did the rest as stream of consciousness
03:33:45 <ihope__> Stream of consciousness, eh?
03:39:07 <ihope__> It reminds me of early xkcd, too.
03:39:48 -!- ihope_ has quit (Read error: 110 (Connection timed out)).
03:41:28 <ihope__> A version that requires imagination: http://pastebin.ca/904658
03:41:47 <ihope__> Max and Marcus are absolutely not named after the 1/0 characters of that name, maybe.
03:42:47 <ihope__> Though what I'd really like to see is a continuation of yours.
03:45:27 -!- ihope___ has joined.
03:45:31 -!- ihope___ has changed nick to ihope.
03:45:39 <ihope> Hmm. The line breaks got deleted, but they weren't necessary: http://nonlogic.org/dump/text/1203046923.html
03:45:57 <ihope> My gosh, who set my system clock forward an hour? :-P
03:55:28 -!- oerjan has quit ("Good night").
04:03:16 -!- ihope__ has quit (Read error: 110 (Connection timed out)).
04:05:44 <RodgerTheGreat> http://www.nonlogic.org/dump/images/1203048152-thinkagain.png
04:09:30 <ihope> I'll definitely need to give this stuff a try. :-)
04:09:46 <ihope> I think I even have a scanner. :-P
04:10:43 <ihope> Well, it's late and everyone else is sleeping.
04:11:14 <ihope> I'll do it tomorrow. Hold me to that.
04:11:42 <ihope> Hey, maybe I'll do some rough drawings right now, but I won't really be able to scan them until tomorrow.
04:14:46 <RodgerTheGreat> http://www.undefined.net/1/0/0/84.gif <- so this is where those are from?
04:15:16 <ihope> Absolutely not. :-P
04:16:27 <ihope> So, there's this big flat landscape, with a bunch of square holes in it, all aligned and of the same size but randomly scattered. A man dressed in a suit is standing in one of the holes and it comes about up to his waist; he's saying "This is you."
04:17:08 <ihope> You know it's surreal when you pull stuff right out of your dreams. That's where the landscape with holes comes from.
04:18:54 <ihope> "Be very careful", his voice says (he's just standing there silently this time), "or else you'll go blind. Once you go blind, you can never see again. You'll have to start over."
04:20:40 <ihope> "Welcome", says the voice, but suddenly everything goes dark and you fall down into nothingness. At that point, you know that everything will be all right.
04:21:13 <ihope> I'll be going to bed right now. Good night.
04:41:42 -!- ihope has quit (Read error: 110 (Connection timed out)).
05:58:07 -!- Sgeo has quit (Remote closed the connection).
07:39:50 -!- Sukoshi` has joined.
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
08:57:12 -!- uvanta has joined.
09:51:02 -!- Sukoshi` has left (?).
10:00:58 -!- puzzlet has quit (calvino.freenode.net irc.freenode.net).
10:00:58 -!- lifthrasiir has quit (calvino.freenode.net irc.freenode.net).
10:00:58 -!- RodgerTheGreat has quit (calvino.freenode.net irc.freenode.net).
10:01:53 -!- puzzlet has joined.
10:06:39 -!- RodgerTheGreat has joined.
10:07:45 -!- lifthrasiir has joined.
10:21:15 -!- uvanta has quit ("blame!").
11:20:43 -!- olsner has joined.
11:29:28 -!- sebbu has quit (Connection timed out).
11:50:12 -!- olsner has quit ("Leaving").
11:54:31 -!- Corun has joined.
12:06:45 -!- puzzlet has quit (Remote closed the connection).
12:06:49 -!- puzzlet has joined.
12:15:23 -!- Corun has quit ("This computer has gone to sleep").
12:20:52 -!- es0n00b has joined.
12:21:45 <es0n00b> at last, my creation is coming to fruition. hahahaha
12:22:20 <es0n00b> yeah. it's clunky, but it just might work
12:22:35 <es0n00b> http://www.esolangs.org/wiki/NMISC
12:23:11 <es0n00b> still nowhere near complete. still probably contains some stupid errors, but the idea is all there
12:24:36 <es0n00b> so, anyhoo, slerah_, hows your day been?
12:24:50 <slereah_> Well, I woke up 20 minutes ago
12:25:12 <slereah_> I'm trying to work on my esolangs.
12:25:50 <slereah_> If I dig a lot, will I see you?
12:26:04 <es0n00b> funny- was talking to you this morning (last night for you) and now tonight (this morning for you). gonna have to check that time difference.
12:26:39 <es0n00b> theres a google maps hack that does a virtual dig from one side of the plant to another
12:26:49 <es0n00b> i end up in the middle of a huge ocean
12:27:06 <es0n00b> whats the esolang you working on
12:27:17 <es0n00b> (can remember where i dig to)
12:27:29 <slereah_> Some functional language based on mu*recursive functions.
12:28:06 <es0n00b> read about lambda calculus. didnt make any sense to me
12:28:22 -!- es0n00b has quit (Read error: 104 (Connection reset by peer)).
12:30:28 -!- es0n00b has joined.
12:31:02 <slereah_> Lambda calculus is hard to get.
12:31:15 <slereah_> But after that, it has some good point.
12:31:34 <slereah_> It's easy to construct a program piece by piece.
12:31:56 <slereah_> (Plus, Mulambda is more of a pun, there's no real link with lambda calculus)
12:32:09 -!- sebbu has joined.
12:32:56 <es0n00b> http://www.ubasics.com/dighole/
12:33:52 <slereah_> Mu-recursive functions is four functions. Successor (+1), projection (choose an argument out of n), 0 and the µ function (µy(x, y, z, ...) finds the smallest y that make the function vanish, or returns 0 otherwise)
12:34:07 <slereah_> You make functions out of it, and there you have it.
12:34:19 <es0n00b> (hang on - wife wants me to do stuff)
12:35:56 <slereah_> Hm. On the other side of the world, there's almost New Zealand.
12:36:11 <slereah_> A few hundred miles away from Christchurch.
12:37:26 <es0n00b> yeah- you are almost 12 hours out of sync with us (or we're almost 12 hours out of sync with you) +/- a few hours
12:38:14 -!- timotiis has joined.
12:38:30 <es0n00b> ok- MU seems weird but kind of interesting.
12:39:06 <es0n00b> any good web pages describing MU in an easy to understand style??
12:39:20 <slereah_> It's the oldest algorithm method in existance!
12:40:02 <slereah_> Although when it was created, it wasn't TC
12:40:25 <slereah_> http://en.wikipedia.org/wiki/Mu-recursive_function
12:41:56 <slereah_> Well, actually, it was the combinators first, I think.
12:42:25 <slereah_> But there's plenty Unlambda around
12:42:42 <es0n00b> seems like a lot for only just 4 instructions
12:44:53 <es0n00b> think i might just to imperative programming languages. minimalistic functional programming languages are going to give me nightmares
12:45:23 <slereah_> IT's hard to work without a memory or variables.
12:45:41 <slereah_> But then again, as the name implies, it's easy for functions.
12:46:03 <slereah_> CAT programs might be easier in BF, but not arithmetics.
12:46:26 <es0n00b> cant imagine trying to make a chip based on minimalistic functional programming, too unwieldly
12:46:49 <slereah_> I once tried to make one on mah Turing machine.
12:47:41 <slereah_> Problem being, you have to rewrite the code at every step.
12:48:19 <slereah_> Well, at least that's how I did it.
12:48:57 <es0n00b> the reason I based NMISC on multiplication is just for that - to make a minimal imperative language thats easy for arithmetic. Once you have multiplication, Taylor polynomials are just around the corner
12:49:29 <es0n00b> (rewrite code at EVERY step - ouch!!)
12:50:07 <es0n00b> I like a challenge, but im not fond of banging my head against the wall just to hear the sound of it
12:50:53 <slereah_> Well, in combinators, the only way to keep track of anything is the code itself, since it doesn't deal with memory.
12:51:01 <es0n00b> is your esolang work related to your physics at all, or just a hobby
12:51:20 <slereah_> I don't like to bang my head against the wall either.
12:51:57 <slereah_> (The functional language in question is : http://www.esolangs.org/wiki/Lazy_Bird )
12:52:58 <slereah_> A vain attempt at making a minimal functional language easier.
12:53:06 <slereah_> Although the functions are quite compact.
12:53:07 -!- es0n00b1 has joined.
12:53:17 <es0n00b1> arrgh - keep loosing the connection
12:53:22 <slereah_> [13:51] <slereah_> Just a hobby.
12:53:23 <slereah_> [13:51] <slereah_> (The functional language in question is : http://www.esolangs.org/wiki/Lazy_Bird )
12:53:23 <slereah_> [13:52] <slereah_> A vain attempt at making a minimal functional language easier.
12:53:23 <slereah_> [13:52] <slereah_> Although the functions are quite compact.
12:53:23 <slereah_> [13:52] --> es0n00b1 has joined this channel
12:53:27 <es0n00b1> what was that web address again??
12:57:14 <es0n00b1> really cant make head or tail of Lazy Bird.
12:57:57 <slereah_> Well, for instance, the Fibonacci is thusly :
12:59:04 <slereah_> ^x^y [A printing function that takes y as an argument] xx [a function to change the sort-of memory that takes x as an argument]
12:59:47 <slereah_> If I call that function u (and that's pretty much what it is), and I apply it to itself (`uu), I get :
13:00:08 <slereah_> ^y [A printing function that takes y as an argument] uu [a function to change the sort-of memory that takes y as an argument]
13:00:32 <slereah_> The ^x disappear because it suffered function application, so all x's are replaced by the argument.
13:00:55 <slereah_> If I apply it to the list [0, 1], I get :
13:01:11 -!- jix has joined.
13:01:30 <slereah_> [Prints the first element of [0,1]] uu [a function to change [0,1]]
13:01:58 <slereah_> It then prints 0, and the printing function disappear (because it converts to the identity function)
13:02:24 <slereah_> So I'm left with uu [a function to change [0,1]], which then converts to uu [1,1]
13:02:43 <slereah_> And I'm back at the beggining, but with a new argument.
13:03:33 <es0n00b1> but how is it adding the arguments together.
13:04:09 <es0n00b1> i must have missed the addition within the code
13:04:18 <slereah_> I use Church numerals. It's ^f^x f(f(f(f(...f(x)...))))
13:04:31 <slereah_> The number of f's indicates the number.
13:04:56 <es0n00b1> i understand you have to use the adding function, but where is it in the code?
13:06:00 <slereah_> But well, to make it more compact, and to avoid using variables, I used the combinators.
13:06:22 <slereah_> `sb is equivalent to ^a^f^x.f(afx). It means +1
13:06:58 <slereah_> Because if you enter a Church numeral into that function, for instance two ^g^y.g(gy), you get :
13:07:03 <es0n00b1> ok - this looks like a whole new area of maths
13:08:29 <slereah_> (^a^f^x.f(afx))^g^y.g(gy) converts to ^f^x.f(^g^y.g(gy)fx) (a replaced by ^g^y.g(gy)), converts to ^f^x.f(^y.f(fy)x) (g replaced by f), converts to ^f^x.f(f(fx)) (y replaced by x)
13:09:09 <slereah_> So in the end, your function is the argument of a new f.
13:09:48 <es0n00b1> ok - kind of follow. your using recursion. dont pretend to understand the rest
13:10:22 <slereah_> They're used for function iteration.
13:10:51 <slereah_> So for instance, if to the number 3, I apply two arguments, the successor argument (s, meaning +1) and another number, you get :
13:10:58 <es0n00b1> yeah - i keep finding "Church numerals" in a number of places
13:11:50 <slereah_> (^f^x.f(f(f(x)))) s 5 converts to (^x.s(s(s(x)))) 5 converts to s(s(s(5)))
13:12:15 <slereah_> So you take the successor of 5, and the successor of the successor, and the successor of it
13:13:05 <slereah_> Or ^f^x.f(f(f(f(f(f(f(f(x))))))) in lambdas.
13:13:29 <es0n00b1> but you dont need a symbol for the number 5, as 5 can be determined as a string of successions from 0??
13:13:51 <slereah_> Yes. I just write it 5 because it's shorter.
13:16:11 <es0n00b1> right. kind of getting the idea behind it. still not fully understanding all the symbols involved
13:16:27 <slereah_> Well, there's only two symbols.
13:16:50 <slereah_> There's the lambda (I use ^ for it, sometimes people use \), and there's variables.
13:17:51 <slereah_> If there's a variable that's next to a lambda, it's bound. The most important thing about this is that, if there's something applied to the expression, the left-most lambda symbol is replaced by that expression.
13:19:04 <slereah_> There's also the delta, but I think I never saw it outside of Turing's paper.
13:20:10 <slereah_> Well, the syntax is, the dot only serves the purpose of separating lambda variables from the expression itself.
13:20:23 <slereah_> That way, you can just use one lambda.
13:20:50 <slereah_> For instance, ^x(^y(^z(xyz))) can be written as ^xyz.xyz
13:21:58 <es0n00b1> does (^xyz.xyz)a make any sense
13:22:59 -!- oerjan has joined.
13:23:06 <slereah_> Hell, the original Chruch notation was {^x{^y{^z[(xy)z]}}} (a)
13:23:38 <slereah_> (^xyz.xyz)a -> Leftmost bound variable is x -> ^yz.ayz
13:24:11 <es0n00b1> multiplication is the built out of additions somehow
13:24:30 <slereah_> The other notation convention is that abc = (ab)c
13:24:39 <slereah_> You can build it out of addition
13:24:54 <slereah_> But multiplication is actually easier than addition in lambdas.
13:25:37 <slereah_> Multiplication is ^m^n^f.n(mf)
13:26:52 <es0n00b1> ok - can it perform integration or differentiation. I have a nasty little differential equation that has been bothering me since my old PhD days
13:27:18 <slereah_> But there's no simple way to do it
13:28:43 <es0n00b1> you any good at differential equations. My problem SHOULD have a solution, but I have no idea how to attack it easily
13:29:42 * oerjan notes "Sukoshi`" in this morning's logs
13:29:57 <oerjan> just after we talked about her...
13:30:04 <slereah_> TRWBW is always giving me the look because I use differential elements as variables
13:30:25 <slereah_> "DIFFERENTIALS DO NOT WORK THAT WAY"
13:30:37 <es0n00b1> dx/dt=Aexp(-B/t)*(x^m)*(1-x)^n
13:31:26 <es0n00b1> (trying to remember which version of the equation this is, so it will work properly)
13:31:53 <slereah_> Are the x^m and all outside of the exponential?
13:33:04 <slereah_> So... A * (x^m) * [(1-x)^n] * e^(-B/t)?
13:33:11 <es0n00b1> initial conditions start at x=0,t=0
13:34:09 <es0n00b1> and i know x=0,t=0 LOOKS wrong, but it works if you rearrange the equation to two integrals, with x on one side and t on the other, and use x=0 and t=0 as limiting conditions
13:34:48 <slereah_> Well, I'd personnaly just say that it's dx = A * (x^m) * [(1-x)^n] * e^(-B/t) dt, and then integrates to get x(t) = A * (x^m) * [(1-x)^n] * e^(-B/t) * (-1/B)
13:35:21 <slereah_> And then, mathematicians would get their Morbo masks and say "DIFFERENTIALS DO NOT WORK THAT WAY"
13:35:32 <es0n00b1> so INT(x=0->x,(x^-m)*x^n.dx)=INT(t=0->t,Aexp(-B/t).dt)
13:36:10 <es0n00b1> oops: INT(x=0->x,(x^(-m))*x^(-n).dx)=INT(t=0->t,Aexp(-B/t).dt)
13:36:48 <slereah_> Well, I didn't use boundaries for the integration.
13:36:56 <es0n00b1> integrals on both sides do not have elimentary solutions
13:37:05 <slereah_> There's a constant that should remains, but you can get rid of it via initial conditions.
13:37:38 <es0n00b1> true. starting conditions are important though
13:37:49 <slereah_> I don't have pants on and I should get going in 5 minutes.
13:38:09 -!- Corun has joined.
13:38:16 <es0n00b1> as i want to solve for t when x=1
13:38:22 <slereah_> You can check #math, they'll probably help you.
13:38:27 <es0n00b1> or, at least a good approximate
13:38:36 <es0n00b1> may go there later. time for bed.
13:39:08 <es0n00b1> have a good day. it's gonna be a hard nights sleep for me. the brain might not stop for a while now.
13:39:21 -!- es0n00b has quit (Read error: 131 (Connection reset by peer)).
13:39:21 -!- es0n00b1 has quit (Read error: 131 (Connection reset by peer)).
13:55:03 -!- ihope has joined.
14:00:35 -!- helios24 has joined.
14:05:58 -!- ihope_ has joined.
14:23:18 -!- ihope has quit (Read error: 110 (Connection timed out)).
15:01:05 -!- tejeez has joined.
15:54:04 -!- ehird` has joined.
15:54:27 <ehird`> haskell code looks really good on one line
15:55:08 <ehird`> turing machine was post-LC, i believe
16:01:03 -!- oerjan has quit ("Et cetera, et cetera").
16:05:04 -!- tejeez_ has joined.
16:09:09 -!- tejeez has quit (Read error: 145 (Connection timed out)).
16:17:56 -!- atsampson has quit ("Lost terminal").
16:21:29 -!- tejeez_ has changed nick to tejeez.
16:31:44 -!- ihope_ has quit (Read error: 110 (Connection timed out)).
16:32:54 -!- helios24 has quit (Remote closed the connection).
16:33:22 -!- helios24 has joined.
16:50:39 <slereah_> They wdere pretty much the same year
16:59:31 <slereah_> That narrow it down to a few hundred languages
17:00:37 -!- ihope_ has joined.
17:00:40 -!- ihope_ has changed nick to ihope.
17:01:43 -!- ihope_ has joined.
17:19:08 -!- ihope has quit (Read error: 110 (Connection timed out)).
17:36:16 -!- puzzlet_ has joined.
17:49:11 -!- puzzlet has quit (Read error: 110 (Connection timed out)).
17:53:32 -!- ais523 has joined.
18:00:49 -!- atsampson has joined.
18:15:13 -!- puzzlet_ has quit (Remote closed the connection).
18:15:16 -!- puzzlet has joined.
18:43:35 -!- ehird` has quit (Read error: 113 (No route to host)).
18:44:45 -!- ehird` has joined.
18:45:43 -!- ais523 has quit ("""").
19:26:06 -!- slereah__ has joined.
19:26:53 -!- slereah_ has quit (Read error: 104 (Connection reset by peer)).
19:29:31 -!- asiekierka has joined.
19:29:54 <asiekierka> Is there a BF interpreter that shows the movement of the head?
19:31:26 <slereah__> Also the one on the Love Machine 9000, if you chose to display the memory tape.
19:42:27 -!- Tritonio_ has joined.
19:45:43 -!- as13k13rka has joined.
19:46:55 <as13k13rka> is there a BF interpreter for mobile phones? Java
19:59:17 -!- asiekierka has quit (Read error: 110 (Connection timed out)).
19:59:31 -!- asiekierka has joined.
20:11:15 -!- as13k13rka has quit (Read error: 110 (Connection timed out)).
20:26:44 -!- asiekierka has quit (Read error: 110 (Connection timed out)).
20:27:00 -!- faxathisia has quit ("If there are any aliens, time travellers or espers here, come join me!").
20:34:13 <GregorR> I'm sure it wouldn't be all that complicated to write one.
20:37:08 <oklopol> it's the owner that writes.
20:52:08 -!- Sgeo has joined.
21:00:59 -!- oerjan has joined.
21:06:24 <ehird`> Chapter 10: An Essay on the Notion: "The Scope of Variables"
21:06:43 -!- ihope_ has quit ("ChatZilla 0.9.80 [Firefox 2.0.0.12/2008020121]").
21:08:03 <oerjan> Chapter 11: "The Scope of Essays": A variable notion
21:33:40 <oklopol> whazz the password to read your essay on AMS
21:39:35 -!- oklopol has quit (Read error: 104 (Connection reset by peer)).
21:43:31 -!- oklopol has joined.
21:45:22 <oklopol> i tried to allocate some memory, so the natural result was a reboot
21:45:37 <oklopol> ubuntu always knows what's best for me
21:56:33 -!- sebbu has quit ("@+").
22:12:19 -!- sebbu has joined.
22:17:08 <ehird`> oklopol: i assume you have to pay/be a member of AMS to read it
22:32:05 -!- jix has quit ("This computer has gone to sleep").
22:56:16 -!- Corun has quit (Read error: 110 (Connection timed out)).
23:09:13 * Sgeo has an interesting idea for domain4, actually
23:10:30 <Sgeo> The first function should control what format most functions use
23:11:45 <Sgeo> Does anyone care?
23:13:09 * Sgeo also thought of a new type
23:17:29 <pikhq> ehird`: LC and TM were produced independently, and published in consecutive months.
23:18:53 <Sgeo> Which will be a string containing no newlines
23:21:57 <Sgeo> Also, 0x00 0x04 0x00 controls whether functions in domain 0x04 accept FNUM(1), LNUM, or VARG(LNUM)
23:27:51 <Sgeo> http://trac2.assembla.com/psox/changeset/65/trunk look good?
23:31:56 <Sgeo> Any comments on that changeset?
23:42:28 -!- ihope has joined.
23:45:11 <ihope> Which is a greeting followed by something else, I guess.
23:45:36 <ihope> Clearly, I should start greeting people with "gse".
23:45:42 <oerjan> Greetings Supreme Evil Overlords
23:47:39 <ihope> Not just Evil Overlords, but Evil Overlords Ruining Just Another Nation. Or something like that, anyway.
23:48:05 <slereah__> Well, I for one welcome I supreme evil overlords.
23:48:40 <ihope> Hello, International Of-Pancakes Experts!
23:51:53 -!- es0n00b has joined.
23:53:07 <Sgeo> Hello esotericnewbie
23:53:53 <oerjan> Will any backwards-in-time travellers in the channel please write "Hello, world!"
23:54:23 <es0n00b> (sorry, i just loves "Hello, world!" programs)
23:55:36 <es0n00b> i'm currently wrestling with the idea of Church numerals. I blame slerah_
23:55:53 <Sgeo> es0n00b, look at my latest commit?
23:57:22 <es0n00b> Sgeo> what you mean by "commit?"
23:57:37 <Sgeo> Just look at http://trac2.assembla.com/psox/changeset/65/trunk
23:58:18 <oerjan> slereah__: hah, imposter!
23:58:30 <es0n00b> Howdy ho slereah_. Hows your day?
23:58:37 <oerjan> you didn't write it _before_ my request like es0n00b did.
23:58:55 <slereah__> I think I got a cold or something.
23:59:15 <Sgeo> I think I'll work on the basics to make an Internet enabled BF program now
23:59:50 <oerjan> that's not time travel, just relativity.