00:18:54 -!- RodgerTheGreat has quit. 00:20:05 -!- RodgerTheGreat has joined. 00:23:06 #$@% cars 00:23:10 *cats 00:25:37 -!- Sgeo has joined. 00:28:57 -!- oerjan has quit ("leaving"). 00:29:30 sweet 00:29:37 my dad got me a pocket protector 00:29:39 :P 00:29:51 ooh, neat 00:30:07 indeed 00:30:30 if I had shirts with pockets, I'd wear one all the time 00:30:54 me too 00:31:13 -!- oerjan has joined. 00:31:19 I can see myself using a pocket protector, if I wore shirts with pockets 00:31:56 what logo does your pocket protector have on it? 00:32:02 -!- tgwizard_ has quit (Remote closed the connection). 00:32:26 a very small "JM" imprint 00:32:43 nothing else 00:33:04 classy 00:48:54 -!- cmeme has quit (Read error: 104 (Connection reset by peer)). 00:49:09 -!- cmeme has joined. 00:52:15 holy crap 00:52:15 http://mathforum.org/kb/message.jspa?messageID=1375971&tstart=0 00:56:48 is that written by *the* John Conway? 00:57:06 -!- sebbu has quit (Client Quit). 00:57:07 I know pi to 51 decimal places 00:57:43 I never find myself needing more than the first seven- I've never really tried memorizing them 01:00:18 RodgerTheGreat: yes 01:00:28 cool 01:00:36 that's what impressed me 01:00:50 cellular automata and memorizing pi. 01:00:53 although his technique is pretty nice too 01:00:57 I agree 01:01:11 bsmntbombdood: how did you memorize it? 01:01:16 it's often easy to memorize sequences of numbers by their spoken "beat" 01:01:48 sine-cosine-cosine-sine-three-point-one-four-one-five-nine and the like 01:02:49 this is probably made easier if you combine some groups of 2 digits into one number 01:03:07 three fourteen fifteen etc 01:03:48 what's interesting about John Conway is that among this crowd, he's a celebrity, whereas most places nobody would bat an eyelash at the name 01:06:22 lament: yeah- chunking numbers is another extremely effective way of reducing the difficulty of memorizing things 01:10:03 lament: couple boring days in middle school math 01:10:16 haha 01:10:36 it breaks itself up into easily memorizable pieces 01:11:58 1415 92 653 5897 9323 846264 3383... 01:12:54 another way to "memorize" it could be to memorize an algorithm for finding successive places.... 01:13:12 slower in recall, but at least as useful 01:13:32 that would be terrible difficult 01:14:41 before you've played with esolangs, something like BF is difficult to wrap your head around. Now, it comes naturally to all of us. 01:19:22 that's true 01:22:25 one of the reasons I like esolangs is the fact that they have a way of liberating one's mind with respect to programming. 01:22:59 I feel sad for people who only think of programming in terms of C++ and Java 01:23:16 concur 02:08:00 -!- oerjan has quit ("Good night"). 03:06:07 Today is (ln -1)/i day! 03:06:55 cool 03:07:11 we need to do something special at 1:59 03:07:23 Whose 1:59? 03:07:34 mmm, pi 03:10:08 Sgeo: good question 03:10:29 GMT-92 ? 03:10:41 Whatever that turns out to be equivelent to? 03:10:51 sounds equitable 03:11:09 what would be an appropriate celebration? 03:31:23 bsmntbombdood: i like conway's division more than yours :) 03:31:41 * lament memorized pi to 30 places with conway's thing 03:31:56 hmm 03:32:27 his is almost like a poem 03:33:22 "1415 9265 35" - rhymes 03:33:53 reading it doesn't make any sense 03:35:07 8979 (rhyme) 3238 (rhyme the other way) 4626 (rhyme) 4338 (rhymes with the second quadruplet) 03:36:12 just express rhymes like you would if you were analyzing poetry: ABAB 03:36:31 at last, taking AP English seems worthwhile 03:36:57 Next time I have to write some poetry for class I'm just going to mark v. shaney some poe 03:42:05 1233564- quoth the constant, nevermore. 03:43:18 it would be interesting writing a program that would translate a sentence into a series of numbers that had the same rythm when read 03:44:01 it might be as simple as assigning numbers based on rhyme pairs 03:44:13 but I'm not certain that would always work 03:46:29 -!- GreaseMonkey has joined. 03:46:31 -!- thematrixeatsyou has joined. 03:46:46 howdy GreaseMonkey, thematrixeatsyou 03:47:12 -!- thematrixeatsyou has left (?). 03:48:04 sorry bout that, accidentally connected twice D: 03:48:31 I was wondering if it was you and your bot or something 03:50:24 GreaseMonkey: how do you think we should celebrate the upcoming pi day? 03:50:24 i accidentally opened two server tabs 03:50:33 \sum_{i=1}^\infty{10^{-i}i} 03:50:39 hmm.... 03:50:46 what's the formula for pi again? 03:50:50 i can never remember it 03:50:53 lots 03:51:06 there's a couple of tangents in it 03:51:12 1/1 - 1/3 + 1/5 + 1/7... 03:51:15 is one 03:51:35 converges very slowly though 03:52:32 should that second + be a -? 03:52:53 i think so 03:52:56 terms usually alternate in a mclaurin series (which that vaguely resembles) or stay constant 03:53:06 if you get my meaning 03:53:30 the upcoming pi day? 03:53:46 yeah 03:53:49 typed wrong 03:53:52 lament: today 03:54:14 I'm defining the official celebration as 1:59, GMT 03:54:19 because that makes sense 03:54:20 and that's actually pi/4 03:54:53 why GMT? 03:55:00 it should be GMT-pi 03:55:55 http://en.wikipedia.org/wiki/Leibniz_formula_for_pi 03:56:24 that sounds clumsy to calculate, unless we use metric time or something 04:02:28 we should write a "pidaydaemon" that interrupts whatever you're doing with the terminal at the precise moment of pi day and encourages you to celebrate 04:02:54 impossible. 04:02:56 pidaymon 04:04:23 lament: brilliant! 04:04:55 #EsoMon: gotta appt-get 'em all! 04:27:13 good night, folks 04:27:23 -!- RodgerTheGreat has quit. 04:30:17 -!- ShadowHntr has joined. 04:40:29 -!- ShadowHntr has quit (zelazny.freenode.net irc.freenode.net). 04:40:29 -!- Caphi has quit (zelazny.freenode.net irc.freenode.net). 04:40:29 -!- bsmnt_bot has quit (zelazny.freenode.net irc.freenode.net). 05:43:18 -!- Sgeo has quit ("Leaving"). 06:49:22 -!- ShadowHntr has joined. 06:59:15 afk, food 07:19:44 back 07:50:05 -!- maverickbna has joined. 07:50:22 -!- maverickbna has quit (Read error: 104 (Connection reset by peer)). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:08:56 -!- ShadowHntr has quit (Connection timed out). 08:29:48 -!- sekhmet has quit (Read error: 104 (Connection reset by peer)). 08:34:04 -!- sekhmet has joined. 08:40:04 -!- sebbu has joined. 09:09:43 -!- jix has joined. 09:16:52 -!- ShadowHntr has joined. 10:05:18 gtg, gnight 10:07:19 -!- GreaseMonkey has quit ("gnight - avoid encyclopediadramatica at all costs."). 10:29:19 -!- ShadowHntr has quit ("End of line."). 11:57:05 -!- jix__ has joined. 12:06:13 -!- jix has quit (Read error: 113 (No route to host)). 12:46:32 -!- oerjan has joined. 12:55:47 all this talk about celebrating pi at 3/14 1:59 (GMT/GMT-pi) and none of the Americans noticed that those times had long since passed. 13:35:03 -!- oerjan has quit (zelazny.freenode.net irc.freenode.net). 13:35:24 -!- oerjan has joined. 13:45:35 -!- jix__ has changed nick to jix. 14:13:34 -!- helios24 has joined. 15:56:10 -!- crathman has joined. 16:12:52 -!- RodgerTheGreat has joined. 16:13:06 hello everyone 17:26:57 -!- crathman has quit ("Chatzilla 0.9.77 [Firefox 2.0.0.2/2007021917]"). 18:00:10 -!- oerjan has quit ("leaving"). 18:25:46 -!- tgwizard has joined. 19:11:47 -!- nazgjunk has joined. 19:13:07 -!- nazgjunk has quit (Read error: 131 (Connection reset by peer)). 19:16:48 -!- nazgjunk has joined. 19:54:50 -!- UpTheDownstair has joined. 19:55:06 -!- nazgjunk has quit (Read error: 131 (Connection reset by peer)). 19:55:33 -!- UpTheDownstair has changed nick to nazgjunk. 19:58:18 -!- jix has quit ("This computer has gone to sleep"). 21:29:16 -!- UpTheDownstair has joined. 21:32:02 -!- nazgjunk has quit (Read error: 145 (Connection timed out)). 21:36:19 -!- sebbu2 has joined. 21:43:14 -!- sebbu has quit (Read error: 60 (Operation timed out)). 22:23:42 haha 22:23:56 C is a sad language, because most lines end with ); 22:24:03 ); 22:28:38 haha 22:29:24 even worse, all those curly brackets make fun of people with cleft palates- :{ 22:30:09 'course, that exact combination doesn't happen very often that I can think of... 22:36:50 -!- oerjan has joined. 22:38:40 is :{ possible in C at all? 22:39:31 can an expression begin with just { ? 22:40:29 hm 22:40:36 a good question 22:41:24 Plof has a lot of }); 22:41:31 I know one way it's *possible*, but not in a functional expression 22:41:43 A static struct. 22:41:57 there you go 22:41:58 struct foo a = { b:{stuff in a.b} }; 22:42:10 ah 22:42:16 I haven't used that syntax in a while, I may be a bit off ;) 22:43:06 indeed it seems a bit weird to have that inner { } 22:43:41 Well, that much I know is legit :) 22:43:51 If a struct contains a struct, and you're declaring one statically, that's how you do it. 22:44:06 ok 22:45:49 huh? 22:45:52 :{ ? 22:50:53 found a BNF for C at http://www.cs.man.ac.uk/~pjj/bnf/c_syntax.bnf 22:51:02 i don't think you can have that 22:51:10 however, i cannot make your suggestion parse with it. 22:51:34 first, it's = not : but that is not so important. 22:52:04 worse is that the part to the right of = cannot contain a nested struct. 22:53:09 oh wait. 22:53:21 the _outer_ ={ still works. 22:53:24 -!- nazgjunk has joined. 22:53:49 -!- UpTheDownstair has quit (Read error: 104 (Connection reset by peer)). 22:54:03 ={ 22:54:05 it could of course be an erroneous BNF. 22:57:13 oh, and label :{ block } works. 22:59:09 or, less goto-tainted: case const :{ block } 22:59:45 which looks like it could actually be used. 23:01:51 *snaps* 23:01:59 Oh, heheh, the syntax I gave was D :P 23:03:24 I guess it is probably also available in modern C compilers, being an obvious gap in the original language. 23:05:13 oerjan do you know C? 23:05:49 a bit 23:06:12 C is fun 23:06:23 quite 23:06:38 C is my native language. It was difficult learning an ... unstructured language like English when I was a boy. 23:06:45 :D 23:06:47 struct foo a = { .b = initializer_for_field_b }; is C99 (and a GCC extension for other modes). 23:08:43 Same goes for arrays; int array[256] = { [42] = 1, [69] = 1 }; works if you want to initialize few elements to 1 and keep the rest as 0. 23:09:23 fizzie: wtf? 23:09:29 I've never seen that syntax 23:10:07 Well, full C99-compliant compilers aren't anywhere yet, so I'm not sure it's sensible to use in published code. Perhaps in GCC-specific projects, though. 23:10:59 busy beaver! 23:11:48 hm... you could extend that to function memoing. 23:12:12 See chapter 6.7.8 Initialization in your friendly ISO/IEC 9899:1999 standard; the syntax is "initializer-list: designation_opt initializer --" and a designator can be either "[ constant-expression ]" or ". identifier". 23:12:33 http://eden.dei.uc.pt/~machado/research/bb/BB.html 23:12:56 int fib(int n) { return (fib(n) = fib(n-1)+ fib(n-2)); } = { (0) = 0, (1) = 1 }; 23:13:35 That might be a "bit" too high-level to exactly be very C-like. 23:13:51 hey, i'm just generalizing :) 23:15:52 I want a turing machine interpreter 23:16:13 -!- sebbu has joined. 23:17:13 i saw mention of one with a good graphical interface, perhaps at Good Math/Bad Math. 23:17:34 I had a Turing machine interpreter written in Befunge and syntax-highlighted in the great "messy HTML table with a dozen different background colors for various functional regions" fashion, but I lost it. :/ 23:17:42 The "user interface" wasn't very friendly, though. 23:18:16 abA!6!0!a!1!A!R!0!b!5!b!R!1!a!1!a!R!1!b!2!b!R!2!a!2!a!R!2!A!3!A!L!2!!!3!! 23:18:24 Ngah, borken copypaste. 23:18:53 oh and Mark CC wrote an interpreter himself too 23:18:53 Well, you just fed it a string a bit like that, except that it's not supposed to cut off there, the example I was trying to copypaste continues for a while. 23:19:49 -!- nazgjunk has quit ("Leaving"). 23:19:49 http://scienceblogs.com/goodmath/2007/02/basics_the_turing_machine_with_1.php 23:20:44 a bit verbose syntax though 23:21:05 it is a shame that one of the most historically important esoteric languages is not even recognized as such 23:21:16 all because Turing used a different terminology 23:22:10 what, turing machines? 23:22:57 the JFLAP mentioned in the same thread was the good one i was thinking of. 23:23:00 turing machines are programs in this language 23:23:25 (not that i have tested it myself) 23:23:28 the language does not have a name or syntax. I find that to be a shame. :) 23:23:49 you could say the same about combinatory logic. 23:23:51 There's just more than one 23:24:05 except that does have a name and syntax 23:24:11 oerjan: ... :) 23:24:44 it makes sense to talk of a "combinatory logic" language, in which something like "s k" is a program 23:25:34 no issues there... 23:25:40 among turing tarpits, the distinction between "computational model" and "esoteric language" is mainly based on the apparent seriousness of the inventor. 23:26:07 yes, yes, and yet, combinatory logic and lambda calculus are both easily accepted as languages 23:26:18 hmph 23:26:23 I think the automagical homework checking eggine in one of our courses was JFLAP-based. 23:26:24 and turing machines aren't because the terminology used by the inventor is just too bizarre 23:26:28 With a halting oracle, the max-shifts function is computable 23:26:35 what about the busy beaver function? 23:26:43 oh, it is 23:27:06 generate all n-state turing machines, remove ones that don't halt, then run them all 23:29:29 i could do that standing on my head 23:30:10 haha 23:30:35 your MOM doesn't halt! 23:32:54 I know, she just bitches forever 23:33:11 loop(bitch) 23:34:59 -!- sebbu2 has quit (Connection timed out). 23:50:00 -!- sebbu has quit ("@+").