00:05:53 <oklopol> made my board game ai into an irc bot
00:05:54 <oklopol> [01:02:13] <sujomilo> Human 48 - computer 2644
00:09:58 <oklopol> i lasted for like 10 rounds though!
00:31:04 <graue> bsmntbombdood: research to support the thesis that you can't concentrate on reading books after taking that test
00:32:10 <oklopol> it doesn't mean anything though
01:05:27 -!- nazgjunk has quit (Read error: 110 (Connection timed out)).
01:13:12 -!- nazgjunk has joined.
01:48:45 -!- nazgjunk has quit ("Leaving").
02:05:53 -!- Caphi has joined.
02:11:49 <Caphi> Will someone please say a random number between 1 and 20, inclusive?
02:13:22 <Caphi> Sorry. Someone else tried to take my computer.
02:22:10 <oerjan> Hey, you think I'll give away my best random number for free?
02:23:25 <Caphi> I like the number 17.
02:23:48 <oerjan> 14 is a good random number. Half perfect, in fact.
02:25:26 <Caphi> I just realized, I didn't actually specify an integer.
02:26:07 <Caphi> Or indeed a rational number.
02:27:10 <oerjan> OK, try e*sqrt 2 - pi/omega
02:27:33 <oerjan> just to be completely surreal
02:27:47 <Caphi> Omega? I'm not familiar with that constant.
02:28:14 <oerjan> probably because it isn't a real number.
02:29:03 <Caphi> By which you mean that it's complex or that it's undefined?
02:29:10 <oerjan> it is perfectly well ordered though.
02:30:19 <oerjan> oh that too. omega means too many different things.
02:30:25 <Caphi> Oo. I learned stuff today.
02:30:36 <oerjan> although the uncomputable number is still real
02:30:54 <Caphi> What's the definition for it
02:31:37 <oerjan> i can never remember the correct notation for surreals.
02:32:03 <oerjan> but something like (0,1,2,... | )
02:32:21 <oerjan> the simplest infinite surreal.
02:33:11 <Caphi> No other reason. Oerjan mentioned it.
02:33:25 <oerjan> on the other hand, omega comes from the ordinal numbers as well.
02:33:53 <oerjan> the ordinal numbers can be considered a subset of the surreals.
02:34:33 <oerjan> those with empty right parts, i believe
02:50:09 <bsmntbombdood> my combinator iterpreter fails to simplify ``S``S`KS``S`KK``S`KS``S``S`KS``S`KKI`KI`K``S``S`KS``S`KKI`KI
02:54:25 <bsmntbombdood> ``S``S`KS``S`KK``S`KS``S`K`S`KS``S`K`S`KK``S``S`KS``S`KKI`KI`K``S``S`KS``S`K`S`KS``S`K`S`KK``S``S`KS``S`KKI`KI`K`KI
02:56:01 <bsmntbombdood> my simplifier completely fails to do anything with that, even though there are obvious simplifications
02:57:32 <oerjan> that ``S`KKI inside is pretty severe.
03:00:04 <oerjan> ``S`KxI -> x is the most trivial case of eta reduction.
03:03:30 <bsmntbombdood> When reducing extensionally, it only works with the whole expression
03:06:36 <bsmntbombdood> and ``S``S`KS``S`KK``S`KS``S``S`KS``S`KKI`KI`K``S``S`KS``S`KKI`KI is reduced to S
03:11:36 -!- oerjan has quit ("Good night").
04:14:36 -!- GreaseMonkey has joined.
04:28:47 -!- RodgerTheGreat has quit.
05:05:41 -!- Sgeo has quit ("Leaving").
05:54:02 -!- GreaseMonkey has quit ("gtg guys, cya").
07:17:11 -!- ShadowHntr has quit ("End of line.").
07:44:53 <Caphi> Will someone please produce two random numbers between 1 and 10, inclusive, and tell me their sum?
07:46:48 <Caphi> Never mind. I was trying to demonstrate to someone, but that person left.
07:59:52 <oklopol> Request noted. Minding disabled.
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
08:45:13 -!- Caphi has quit ("Miranda IM! Smaller, Faster, Easier. http://miranda-im.org").
10:04:04 -!- oerjan has joined.
11:02:17 -!- jix has joined.
14:31:11 -!- oerjan has quit ("leaving").
16:03:38 -!- nooga has joined.
16:05:16 -!- graue has quit ("Leaving").
16:13:13 <nooga> SADOL.com wtf?!?!?!?
16:36:31 -!- jix__ has joined.
16:36:37 -!- jix has quit (Nick collision from services.).
16:36:45 -!- jix__ has changed nick to jix.
16:38:33 -!- RodgerTheGreat has joined.
17:39:55 -!- Robdgreat has joined.
17:47:30 -!- oerjan has joined.
17:54:50 -!- tgwizard has joined.
18:07:18 -!- Robdgreat has quit.
19:01:41 -!- jix has quit ("This computer has gone to sleep").
19:30:20 -!- oerjan has quit ("leaving").
19:31:05 -!- oerjan has joined.
19:38:12 -!- sebbu has joined.
20:34:24 -!- nazgjunk has joined.
20:37:01 -!- jix has joined.
21:06:02 -!- sebbu2 has joined.
21:24:48 -!- sebbu has quit (Read error: 110 (Connection timed out)).
21:35:10 -!- sebbu has joined.
21:45:09 -!- UpTheDownstair has joined.
21:46:30 -!- nazgjunk has quit (Read error: 104 (Connection reset by peer)).
21:48:40 -!- tgwizard_ has joined.
21:52:51 -!- UpTheDownstair has changed nick to nazgjunk.
21:54:51 -!- sebbu2 has quit (Read error: 110 (Connection timed out)).
22:00:10 -!- tgwizard has quit (Read error: 110 (Connection timed out)).
22:07:23 -!- Caphi has joined.
23:02:20 -!- jix has quit ("This computer has gone to sleep").
23:20:20 <bsmntbombdood> the max shifts function solves the halting problem
23:32:23 <bsmntbombdood> The value of the max shifts function is uncomputable
23:33:33 <bsmntbombdood> But given the value of S(n), you can solve the halting problem on an n state turing machine
23:35:16 <oerjan> This gave me an idea which I don't know if I've seen the answer to:
23:35:41 <oerjan> Are there uncomputable problems strictly weaker than the halting problem?
23:36:26 <bsmntbombdood> so on a 4 state, 2 symbol turing machines, the halting problem is solvable
23:38:03 <oerjan> it is analogous to how there are, if P!=NP, problems strictly between them.
23:39:18 <oerjan> (that is, problems which are neither in P nor NP-complete)
23:39:31 <lament> what's strictly weaker anyway
23:39:59 <RodgerTheGreat> is it trivial to map one type of turing machine to another via any well-understood algorithm?
23:40:00 <lament> is the problem of sorting apples strictly weaker than the problem of sorting oranges?
23:40:02 <oerjan> say you have a problem which you can solve if you have a halting oracle, but not vice versa
23:40:50 <oerjan> I mean by "strictly weaker" that you have a reduction one way but not the other.
23:41:19 <lament> oerjan: is the problem of deciding the halting of a program equipped with a halting oracle strictly stronger than just the regular halting problem?
23:42:07 <oerjan> in fact that is the premise of one of the languages on the wiki.
23:43:08 <oerjan> actually two: Banana Scheme and Brainhype.
23:43:54 -!- nazgjunk has quit ("Leaving").
23:44:58 <lament> brainhype doesn't really care
23:45:20 <oerjan> but going downward in strength (while still being uncomputable) seems harder.
23:45:45 <lament> (banana scheme mostly appeared exactly because it was unclear what could interpret brainhype)
23:56:18 <lament> hm, this /// lang seems cool