00:25:18 -!- Water2012 has joined. 00:26:09 -!- Water2012 has left. 00:46:45 * Phantom_Hoover -> sleep 00:46:46 -!- Phantom_Hoover has quit (Quit: Leaving). 01:02:50 -!- DCliche has joined. 01:03:25 -!- cheater has joined. 01:06:43 -!- Klisz has quit (Ping timeout: 276 seconds). 01:23:55 http://4.bp.blogspot.com/--dWhUHntf3Q/TyMUQ5jYZVI/AAAAAAAAFWs/ww6aBSXRQJk/s1600/wtf.jpg Because everyone wants to play as crappy boxart Megaman. 01:24:03 -!- DCliche has changed nick to Klisz. 01:37:50 -!- DCliche has joined. 01:39:59 -!- oerjan has quit (Quit: Good night). 01:40:58 -!- Klisz has quit (Ping timeout: 248 seconds). 02:01:02 -!- pir^2 has joined. 02:01:04 -!- pir^2 has quit (Quit: Bye). 02:13:07 -!- nooga has joined. 02:13:22 where's oerjan 02:14:05 Sleeping. 02:15:19 no way 02:15:57 stupid timezones 02:16:06 how come you're up at the mooment 02:16:16 It's 19:15. 02:16:30 The day's barely started. 02:16:31 :P 02:16:53 it's 3:16 here 02:16:56 04:16. 02:16:57 -!- Klisz has joined. 02:17:04 fizzie: +1 hour 02:17:25 doesn't change the fact it's late 02:17:51 And I just woke up, having "just rested a bit" around localtime-23; should "wake up" at 7- or 8-ish instead. 02:18:11 This did not quite go as planned. 02:18:20 i'm drinking since 2200 02:18:49 my wife fell sleep and i'm still up 02:18:51 ;f 02:19:15 -!- DCliche has quit (Ping timeout: 245 seconds). 02:19:35 trying to write graph oriented database in ANSI C 02:21:44 Heeeey, it's *Saturday* "tomorrow". That's not a wake-up-early day. Aw, I's so confused. 02:22:18 graphs graphs graph 02:22:25 I'd say grafy grafy grafy 02:23:53 ew 02:24:32 -!- DCliche has joined. 02:28:02 -!- Klisz has quit (Ping timeout: 255 seconds). 02:28:13 klisz 02:28:37 klisza means a photographic film in my language 02:29:21 -!- DCliche has changed nick to Klisz. 02:29:46 klisz klisz 02:30:12 "your language"? do you refer to Polish, or are you a conlanger? 02:32:16 Polish ofc 02:32:49 or should I say... my native tongue 02:34:08 * Klisz adds klisza to Wiktionary, then, since what they currently only have 'film' as a translation of that 02:34:32 Hungarian also have this sz, but this is pronounced like s in here 02:34:52 Oh yes, I forgot about Hungarian. 02:35:26 sz sounds like sh in English 02:35:40 Kleesh 02:36:30 indeed 02:36:45 weird nick 02:38:03 My original name was "Darth Cliche"; I shortened that to "DCliche" when people kept making Star Wars-related jokes. I in turn changed to Klisz in response to people making jokes about the lack of an acute accent 02:38:04 nooga on the other hand.. 02:38:27 I pronounce it like noga 02:38:36 and it menas "a leg" 02:38:47 means* 02:38:57 but with longer o 02:39:12 not the standard, english oo 02:39:27 Naming yourself 'leeeeeg' is rather weird too ;p 02:39:31 leeeg 02:39:35 that's right 02:39:35 -!- itidus21 has joined. 02:40:03 i was pissed off because someone took my unregistered nick on IRC someday in 90's 02:40:19 an the first thing i typed in was.. nooga 02:40:28 and then it stayed like this 02:40:37 quite 02:40:39 uh 02:40:40 random 02:43:25 :F 02:51:34 -!- nooga has quit (Ping timeout: 252 seconds). 02:52:24 -!- nooga has joined. 02:52:41 i've lost connection 02:55:23 lol 02:55:58 Polish Radio programme 3 broadcasts The Dark Side Of The Moon at the moment 02:56:02 whole album 02:59:05 Good album, at least. 03:04:07 ahhh 03:05:04 any colour you like right now 03:05:47 quite unusual for a public radio to play whole album 03:06:25 recently i've bee to the australian pink floyd show in PoznaÅ„, Poland 03:06:51 and before that i was at the David Gilmour's concert in GdaÅ„sk Shipyard 03:07:18 they played 1.5 of PF and 1h of Gilmour's On An Island 03:07:33 absolutely the best concert in my entire life 03:07:53 been* 03:20:22 Neat. 03:35:47 -!- nooga_ has joined. 03:36:43 -!- nooga has quit (Read error: Connection reset by peer). 03:56:40 -!- DCliche has joined. 03:59:54 -!- Klisz has quit (Ping timeout: 252 seconds). 05:03:06 -!- TeruFSX has joined. 05:14:59 fizzie: what does localtime-23 mean? 05:16:17 hmmhmm 05:57:11 -!- zzo38 has joined. 05:57:53 What castles do you want to see? 05:58:32 -!- Klisz has joined. 06:00:11 -!- DCliche has quit (Ping timeout: 252 seconds). 06:04:47 -!- pikhq has quit (Ping timeout: 252 seconds). 06:04:49 -!- pikhq_ has joined. 06:14:09 zzo38: none really 06:14:31 Then why did you put it in the topic message? 06:15:14 Oh tell me why, do we build castles in the sky? 06:30:10 i didn't 06:30:34 i can't answer for the crazies, you have to wait for them to wake up. 06:47:03 Do you build vampires in the sky here, too? 06:50:25 -!- monqy has quit (Quit: hello). 06:51:14 -!- Klisz has quit (Quit: SLEEP, GLORIOUS SLEEP). 06:51:48 Strange cards for Magic: the Gathering which I have written: 06:52:34 | Gain 5 life if you have paid this spell's kicker cost. | Gain 5 life if you have played this spell for its madness cost. | Gain 5 life when you cycle this card. | (Note this card doesn't have kicker, madness, or cycle.) 06:53:34 | Gain 2 life for each spell on the stack which has split-second. | (When will this have an effect? Perhaps see later...) 06:53:45 -!- augur has joined. 06:54:08 | Flash | Enchant spell | Enchanted spell has split-second. | (Possibly you can use this to force a block of spells to resolve at once, or to set up triggers, or something) 06:54:29 | All permanents with substance are 2/2 creatures in addition to their other card types. | 07:01:28 | Whenever a permanent becomes untapped, put it at the bottom of its owner's library. | 07:02:33 | This has +5/+5 if this is a token. | 07:11:03 | At the end of the game, rewind to the point that this spell resolved, and the loser takes X damage. (Doesn't work if a player concedes) | 07:12:11 what's madness? 07:12:15 or kicker 07:12:49 oklopol: Kicker is an extra cost that may be played when you play the spell card. If you do, then the spell is "kicked" by that instance of the kicker ability. 07:13:35 Madness means if that card is discarded from your hand, you may play the madness cost. If you do, it is exiled and then placed on the stack as if you have played that card. 07:13:50 (It doesn't give you the ability to discard that card, however.) 07:14:50 wait do you have deck and stack, you take cards from deck normally and throw dead things in the stack? or what are these things called 07:15:21 although i suppose you implied discards don't go in the stack 07:15:25 Stack is when spells and abilities wait to resolve, they are placed in a stack. When it is time for one to resolve, the last one is popped from the stack and resolves. 07:15:30 oh- 07:15:40 i mean oh. 07:15:44 (And then it is either put into play or in the discard pile, depending on the card) 07:16:34 okay i'm getting it. 07:30:12 I have made some cards that do strange things with the rules. Such as a card with the type "Instant Land" which remains in your hand when played, a card that skips the cleanup step, a variant of Wrath of God that doesn't actually destroy anything but works anyways because they become planeswalkers without counters, a card that phases out but when it tries to phase back in, it can't because it is an instant... 07:30:20 Some of these things no longer work with the new rules, however. 07:30:54 I have made various cards that only work in one version of the rules and have completely different effects in other versions. 07:32:21 did you do it by saying "in version x, this card ...; in version y, this card doesn't ...", or did you do something insanely clever 07:32:56 oklopol: No. I did something else; it wasn't even intended to work differently in different versions of the rules. 07:33:08 okay 07:33:55 Some of them invoke combinations of rules in ways which are not meant to be used in that way. 07:35:31 (The one that phases out and then fails to phase back in, will still phase back in in the new rules. In the old rules, which were current at the time I wrote that card, the card would in fact, fail to phase in after it has phased out.) 07:41:59 "Phasing. When this card enters play, it becomes an instant in addition to its other types." 07:44:42 I made one card that causes state-based effects to stop working temporarily. 07:47:27 I have made some cards that have an ability with "lose priority" as part of their cost or effect. 07:48:37 Can you understand how my card fails to phase back in in one version of the rules but succeeds in another version? 07:52:14 I don't know if there are slight changes in definition of mana abilities, or other rules that might affect that, that causes some of my effects to work differently in different versions of the rules 07:57:15 I have some cards that fail to do anything useful at all unless you have many other cards affecting certain rules and other things 08:04:11 I have a card named "Dignity" costing {B} with the effect "You lose the game." I can actually think of uses for such a card (and I don't mean copying it onto your opponent). 08:10:51 -!- zzo38 has quit (Remote host closed the connection). 08:22:49 -!- nooga_ has quit (Ping timeout: 252 seconds). 08:28:27 What uses? 08:28:37 -!- Ngevd has joined. 08:30:08 Hello! 08:43:09 -!- Frooxius_ has joined. 08:43:21 -!- Frooxius_ has quit (Client Quit). 08:45:00 -!- Frooxius has quit (Ping timeout: 240 seconds). 08:51:16 -!- Ngevd has quit (Read error: Connection reset by peer). 08:52:22 -!- Ngevd has joined. 09:01:13 -!- Ngevd has quit (Read error: Connection reset by peer). 09:01:36 -!- Ngevd has joined. 09:02:42 -!- Ngevd has quit (Read error: Connection reset by peer). 09:02:51 -!- Ngevd has joined. 09:03:50 -!- Ngevd has quit (Client Quit). 09:51:01 -!- Phantom__Hoover has joined. 10:03:05 why are rings called rings. 10:05:43 <_Slereah> "According to Harvey Cohn, Hilbert used the term for a specific ring that had the property of "circling directly back" to an element of itself" 10:08:12 oh, that's not very exciting... 10:08:56 * kallisti thinks number theory is something that would be interesting. 10:09:17 I'm particularly interested in the Riemann hypothesis. 10:12:57 uh what's a program I can use to convert an svg to a raster file. 10:24:16 -!- Frooxius has joined. 10:28:02 librsvg2-bin. Inkscape. ImageMagick. GraphicsMagick. Gimp. 10:28:24 Outsource it to be done manually by cheap labor. 10:32:27 wasn't there a passage in the bible where the people were all supposed to kill themselves and formed a ring, and counted off and then each stabbed himself or something 10:32:54 and one christian guy told the other christians to stand in specific places so that at some point all that is left are christians 10:33:05 he used ring theory to save 'em 10:33:14 isn't that where the name ring comes from 10:33:31 Misparsed that as "I'm particularly interested in the Riemann hypothesis. Uh, which is a problem I can use to convert an svg to a raster file." Sounded... dubious. 10:33:53 cheater, fuck off. 10:34:10 Phantom__Hoover: u 10:34:12 * kallisti thinks number theory is something that would be interesting. 10:34:12 I'm particularly interested in the Riemann hypothesis. 10:34:22 The Riemann hypothesis isn't number theory. 10:34:27 It's complex analysis IIRC. 10:34:40 isn't complex analysis part of number theory? 10:34:44 i should probably know 10:34:56 Not number theory as it's commonly taken to be. 10:35:21 i.e. the algebraic properties of N (or sometimes Z?) 10:35:34 you totally forgot N_p 10:35:49 complex analysis is usually taken in parallel with differential equations and before control theory 10:35:49 cheater, fuck off. 10:35:52 Phantom__Hoover: u 10:36:42 oklopol: from what i gather there's some mention of holomorphic functions in the NT course, but i wasn't into it so i don't remember 10:36:55 plus our NT guy was some wackjob from max planck institut 10:37:01 Riemann ζ has got that prime thing going for it, which might count. 10:37:42 It has important ties to number theory, and IIRC you can reformulate it purely number theoretically, but the RH itself is complex analysis. 10:40:09 for instance an acquaintance of mine who says she studies analytic number theory actually mostly works with http://en.wikipedia.org/wiki/Maass_form which look very complex analysisy 10:42:19 complex analysis must be really useful for control theory 10:43:17 this is not your dad's number theory, that guy's probably at least level 40 10:43:41 what i mean is, he's probably researching some narrow, advanced field 10:43:59 by dad do you mean my acquaintance? 10:45:00 because my dads math skills are slightly below the average high school graduate. 10:45:07 ...'s 10:45:27 "not your dad's" is a jocular way of saying "advanced" 10:45:42 as in, "those aren't your dad's microscopes" 10:46:37 i guessed that 10:46:44 it comes from the fact that kids, while growing up, would often get tools that are pass-me-downs from their father's or grandfather's time at the same age, usually much less precise instruments than are available at the time 10:47:01 yeah 10:47:09 do you want to study number theory? 10:47:40 i think i'm going in a different direction. 10:47:49 what direction? 10:48:05 dynamical systems, symbolic dynamics, cellular automata 10:48:12 mostly the middle one 10:49:17 is that ever used for computer graphics 10:49:47 :D 10:49:59 by computer scientists, perhaps 10:51:56 we just create dynamical systems by taking a subshift and running a CA on it and look at dynamics or other things 10:52:11 I like how I caused a huge hair-splitting conversation. 10:53:57 i just looked up "fascism" to check the word origin, and i got a context ad for an Italian language course 10:54:24 Learn Italian in Italy 10:59:13 -!- mroman_ has joined. 10:59:15 -!- mroman_ has changed nick to mroman. 10:59:32 Spam is worse these days :( 11:00:13 oklopol: i saw an introduction to symbolic dynamics which says "Imagine a point following some trajectory in a space. Partition the space into finitely many pieces, each labeled by a different symbol. We obtain a symbolic trajectory by writing down the sequence of symbols corresponding to the successive partition elements visited by the point in its orbit." 11:00:27 yeah that's a motivation 11:00:27 oklopol: this very much looks like sampling 11:00:34 ... 11:00:41 wellll perhaps 11:01:33 but like, do you only consider this "sampling" at an "infinite rate" (i.e. every time the partition changes you get a new symbol) or do you also consider situations where this rate is limited? 11:01:53 but anyway i haven't even applied symbolic dynamics to dynamical systems in general, i just solve fun problems of my own creation (and occasionally open ones when i find an interesting one). 11:01:57 err 11:02:03 so what we actually do is 11:02:23 we take a dynamical system, so a compact metric (or just hausdorff) space 11:02:44 and we take a Z-action (or sometimes an N-action) on it 11:03:23 now what we do is we can put a topological partition on the space 11:03:27 i see Morse and Shannon being mentioned in this paper 11:03:40 ok, go on 11:03:51 this means that we have a finite disjoint union of open sets such that their union is dense 11:05:47 now, for "almost every" point, there's a unique sequence of open sets which it goes through, that is, for all almost all x in your dynamical system, there's a sequence (s_i)_i such that T^i(x) is in U_i for all i 11:06:21 here, almost all obviously means residual 11:06:39 define residual 11:06:54 do you mean measure 0? 11:06:55 a countable union of complements of open dense sets 11:06:56 no 11:07:08 that's why it was obvious 11:07:20 it exactly coincided with the definition 11:07:33 define residual 11:08:01 a residual set is a set A that you can represent as a a countable union of complements of open dense sets? 11:08:04 *-a 11:08:45 so those "almost all x" define a residual set? 11:08:52 ah! 11:09:03 yeah almost all obviously means complement of residual :D 11:09:11 i now understand your confusion. 11:09:37 residual sets are "small" 11:09:45 in topology 11:09:58 i realize that, i was just wondering what you're being so smug about 11:10:02 because it made no sense 11:10:13 was i being smug? 11:10:16 so anyways what do you need this Z-action for? 11:10:31 oh the obviously. yeah i just meant it was exactly the definition 11:10:56 is it to define the topology? 11:11:30 no, it's to get a dynamical system, topological spaces are a bit boring without an action. 11:11:54 i wouldn't know 11:12:12 well the point is we just start with a space and a Z-action 11:12:16 we don't ask why 11:12:40 i did a lot of interesting stuff in topology in university without the notion of an action, mostly weird shit related to metric spaces 11:13:03 well i personally just love general topology, but i've been told soooo many times that no one does that anymore so i shouldn't either 11:13:18 of course they do 11:13:30 gauge integrals are hot shit right now 11:13:38 -!- aloril has quit (Ping timeout: 255 seconds). 11:13:59 well of course they do, and in fact symbolic dynamics is way less known than general topology. in fact no one knows what it is like ever. 11:14:08 you've obviously been tricked into doing whatever the person wanted you to do instead of marvellous general topology 11:14:15 ^_^ 11:14:41 if the person wanted me to do whatever i like in a different field from his with a different supervisor, then he has been successful 11:14:59 maybe he was corrupt 11:15:20 for advising you this way, he received better chalk for his lab 11:15:23 gauge integrals do not at all sound like general topology 11:15:27 i've seen that happen 11:15:28 hmm 11:15:32 that sounds likely 11:15:38 AHA! 11:16:08 anyhow i wasn't finished 11:16:28 oh there's more 11:16:29 ok 11:16:37 so now for many many x (and in particular at least one...) we get some sequence of symbols, indexed by whatever our action was by 11:16:38 so what would such a Z-action look like 11:16:42 so say S^\Z 11:16:58 what's \Z? 11:16:59 well for instance multiplication by 2 in [0, 1) 11:17:04 sorry that's integers 11:17:13 oh 11:17:15 ok 11:17:24 my latex notation has gotten stuck 11:17:33 not good enough 11:17:42 i used to use \mathbb{Z} 11:17:44 wait, so is this Z-action badly defined? 11:17:57 as in, 0.5 * 2 = 1 which is not in the integral 11:18:00 or is it modulo 1? 11:18:02 no, it's completely defined in the space X of the dynamical system 11:18:11 -!- derdon has joined. 11:18:23 let's say our space is S^1 11:18:26 yeah sure modulo 1. i was gonna say torus at first but then i didn't know what you understand by that. 11:18:27 yeah 11:18:32 and we define our action to be S^ZZ 11:18:46 which is, btw, how you write integers if you can't be fucked :D 11:18:46 wellllll 11:19:08 then our action just makes the points map to the antipode, right? 11:19:13 or, hm 11:19:16 no, it doesn't 11:19:22 right ok 11:19:29 anyways, i got the hang of it and have a mental picture 11:19:30 @hoogle Product 11:19:30 Prelude product :: Num a => [a] -> a 11:19:30 Data.List product :: Num a => [a] -> a 11:19:30 Data.Monoid Product :: a -> Product a 11:19:31 the action can't really be S^ZZ, the action is a function from X to X. say multiplication by 2 11:19:40 > 2 :: Product 2 11:19:40 Only unit numeric type pattern is valid 11:19:50 oh 11:19:52 > 2 :: Product Int 11:19:53 No instance for (GHC.Num.Num (Data.Monoid.Product GHC.Types.Int)) 11:19:53 arisin... 11:19:59 yes, the "multiplication by 2" happens on the parametrization of S to [0, 1) obviously 11:20:27 you could call the action "multiplication of complex argument by 2" or something 11:20:39 it would be nice if Sum and Product had Num instances, if only for the integer overloading. 11:20:46 that too is a Z-action, right? 11:20:58 well on what space? 11:21:04 see we usually want a compact one 11:21:16 "multiplication of complex argument by 2" on S^2 11:21:19 er 11:21:21 you know who's a boss? 11:21:21 on S^1 11:21:27 Grigori Perelman. 11:21:31 boring 11:21:43 oklopol: that's valid, right? 11:22:05 well multiplication by 2, doesn't that just multiply the length by 2 and take it outside S^1? 11:22:09 or what do you mean by that 11:22:22 you missed the "of the argument" 11:22:27 Arg(z) 11:22:51 -!- sebbu3 has joined. 11:22:59 -!- sebbu3 has quit (Changing host). 11:22:59 -!- sebbu3 has joined. 11:23:19 hmm maybe it looked like "argument of a function" but it meant "argument of the number" :D 11:23:29 cheater: argh, i just realized residual is a countable intersection of dense open sets. you should always take the concept and its negation and guess which makes more sense because i just usually think of them as the same concept. 11:24:01 yeah as you may be able to tell, i'm not always that great with terminology. 11:24:01 they're isomorphic modulo sign of the truth function 11:24:08 yes! 11:24:09 :D 11:24:27 but ummmmmmmmmmmm 11:24:31 so do you understand this function i have defined 11:24:42 if argument is angle then yes 11:25:25 and it's just multiplying by a different number essentially 11:25:32 in cologic, monads are just endofunctors of categories in the monoid. 11:25:52 (also perhaps Soviet Russia) 11:26:24 -!- sebbu2 has quit (Ping timeout: 252 seconds). 11:26:31 no in fact it's not multiplying by a different number, it's multiplying by *the same* number 11:26:39 cheater: in any case we have a partially defined itinerary function from X to S^ZZ. the image of this gives us a so-called subshift (what i research) in S^ZZ, that is, a closed and shift-invariant subset. 11:27:21 let's say my X is this S^1 as i have defined 11:27:32 -!- aloril has joined. 11:27:33 and the action is this multiplication of the angle 11:27:42 what does the function from X to S^ZZ look like? 11:27:59 well we have to choose a partition 11:28:11 let's say the partition is something like.. 11:28:20 your mom claims to be exclusive or, but I know she's really biconditional. 11:28:21 ZING 11:28:26 I am on a role 11:28:27 let's say it's given by the 10th roots of unity 11:28:34 so, I'm going to go to sleep, in order to celebrate. 11:28:38 kallisti: nite 11:28:45 ^celebrate 11:28:46 \o| |o| |o/ \m/ \m/ |o/ \o/ \o| \m/ \m/ \o| |o| |o/ 11:28:46 | | | `\o/´ | | | `\o/´ | | | 11:28:46 /< |\ /| | >\ /´\ >\ | |\ /'\ /´\ 11:28:46 (_|¯'¯|_) /'\ 11:28:46 (_| |_) 11:29:01 cheater: can we use 2nd roots of unity :D 11:29:12 no but we can use 4th 11:29:18 1, -1, i, -i 11:29:22 okay 11:29:23 thanks 11:29:28 but only this once 11:29:31 -!- Frooxius has quit (Ping timeout: 272 seconds). 11:30:20 so, what the map to S^ZZ would do (S = {1, -1, i, -i}, say, and symbol a means the interval starting after a) 11:31:09 is take the two directional orbit, and give the sequence of which quarters your point is 11:31:17 actually not sure this particular one can be 2-directional 11:31:23 oh so this S was not short for "sphere"? 11:31:33 S is the set of indices of partitions yes? 11:31:33 heh no xD 11:31:40 yes 11:32:02 we always call it S because the more standard \Sigma is annoying to type 11:32:39 so. 11:33:12 it would've been useful had you brought this up that it's normally \Sigma 11:33:26 if you take the real 0.000001 in [0, 1) (so just above 1 along complex unit ball) 11:33:35 because \Sigma is normally used for finite or countable sets 11:33:47 well i did mention that the partition is always finite. 11:33:49 yes i take the real 11:33:52 what's next 11:34:03 it's in the "1" partition right? 11:34:04 actually just take 0.0^n1 for a large n 11:34:46 yes, the itinerary should look something like .11111111... for some time ...111i and then maybe -i directly dunno 11:34:48 -!- Frooxius has joined. 11:34:50 erm 11:34:53 what the fuck 11:35:03 yeah i guess that was your action 11:35:31 in terms of RR/ZZ, what was your action again? 11:35:36 is this somehow related to p-adic numbers 11:35:38 i mean i didn't actually get it, i just wanted to keep talking 11:35:49 you *never* say RR 11:35:58 you do |R ! :D 11:36:29 well there are interesting connections but sofar this is just a way to get from topological dynamical systems to symbolic ones. 11:36:30 right, um, the action was you take a point on the unit circle on the complex plane 11:36:36 you multiply its angle by 2 11:36:37 mmhmm 11:36:41 and that's your action 11:37:03 okay so it's just multiplication by 2 11:37:10 on RR/ZZ 11:37:19 which i prefer 11:37:20 yes 11:38:04 yeah so in that case, you would get some 1's and then a -1, then i guess -i and then no one knows. 11:38:19 no we'd get some 1's 11:38:21 and um 11:38:26 then probably an I 11:38:28 i think the map to S^NN is injective here 11:38:36 and then probably a -i 11:38:42 where defined 11:38:57 why are we using the naturals now 11:39:04 yeaaah when i said -1 i meant i. 11:39:04 and not whole numbers 11:39:15 well i didn't know if this was reversible because i didn't understand your action 11:39:22 but yeah it's reversible 11:39:44 (the reverse is *drumroll* division by 2) 11:39:48 erm 11:39:52 i'm a retard :D 11:40:02 is it really reversible 11:40:05 i don't think it is 11:40:07 of course not 11:40:29 so if it's not reversible what happens? 11:40:45 well then you usually just take an NN action. 11:40:48 why is it important whether it is or is not reversible? 11:40:50 ok 11:40:57 so let's first use a reversible one 11:41:07 let's say "adding 0.1 in R/ZZ" 11:41:20 yeah, that's better 11:41:32 although, that's kind of a trivial dynamical system 11:41:40 because 0.1 is rational 11:41:43 yes 11:41:47 ok let's do 0.pi 11:41:51 :P yeah 11:42:01 which is just pi/10 11:42:48 then if you say partition at the middle, you get some crazy subset of S^ZZ, and the original system can be to some extent studied by using the subset of S^ZZ. i don't really know how :D. 11:42:49 and we've got our intervals defined at 0, 0.25, 0.5, 0.75 11:43:08 which correspond to 1, i, -1, -i 11:43:16 i don't really know any properties of pi that would let me investigate this further than "stuff happens!". 11:43:25 ok 11:43:27 so wait 11:43:41 if our Z action is this "add pi/10" 11:43:53 yeah 11:43:54 what does the function from X to S^ZZ look like 11:43:58 it's just a recording 11:44:06 of what a specific point does? 11:44:16 like a .... sampled signal? 11:44:31 that's why multiplying by 2 is nice i guess, you get exactly the binary representation 11:44:41 we got sidetracked and i forgot i was doing that 11:44:41 do you? 11:44:49 that's really cool 11:45:16 well multiplying by 1 is shifting by 1 11:45:19 so umm 11:45:26 what 11:45:32 that made no sense 11:45:34 shifting the binary representation 11:45:39 argh 11:45:39 2 11:45:41 afjöaiowjfoiawejfoiwj 11:45:42 öoiwaejfoöiawejfoiaweoj 11:45:43 fuckfuckfuck 11:45:47 multiplying by 2 11:45:57 are you 11:45:58 sure? 11:46:02 :D 11:46:05 now i'm pretty sure. 11:46:17 1.0011101 * 2 = 10.011101 11:46:20 you can still ask the audience or call a friend 11:46:21 -!- oerjan has joined. 11:46:29 i called a friend 11:46:32 aaaaanywho 11:46:35 what did he say 11:46:41 "narf" 11:46:41 he's oerjan, nothing yet. 11:46:45 oh 11:46:55 oerjan: don't tell him anything! 11:46:59 anyhow so now the first bit of the number can be detected by the partition 11:47:22 wut 11:47:23 since if it starts with 1, then it's in the top half (degenerate points like 0.011111111... aren't a problem since those don't fall in either partition element) 11:47:43 -!- Frooxius_ has joined. 11:48:04 that's cool 11:48:09 so our open sets are (0,0.5) and (0.5,1) 11:48:12 best ever way to reason about fractions 11:48:19 does it work for decimal fractions too? 11:48:22 sure 11:48:29 -!- Frooxius has quit (Ping timeout: 260 seconds). 11:48:42 -!- Frooxius_ has changed nick to Frooxius. 11:48:45 -!- nooga has joined. 11:49:09 but all of this stuff gets way more interesting when you have more dimensions and know stuff about matrices. i can't really say much about that without a reference. 11:49:11 so i can take a number in [0, 1), define some partitions, keep multiplying that number by 10, and i get the decimal representation? 11:49:23 hmm i can see how that works 11:49:37 yeah, the partition is not (0, 0.1) etc 11:49:44 is not? 11:49:47 what is it then? 11:49:51 asdflkasfjklsdjalf 11:49:53 NOW 11:49:53 NOW 11:49:54 NOW 11:49:55 NOW 11:50:03 wow 11:50:06 i'm going to stop living for now okay 11:50:12 k np 11:50:19 this is not working today 11:50:28 now? 11:50:31 this is now working today? 11:50:35 going to the shoppe, buying a thing, and enjoying it. 11:50:43 njoy 11:50:43 :( 11:50:45 you are mean 11:50:46 :( 11:50:48 so mean 11:50:52 average? 11:50:54 yeah 11:50:57 i suppose 11:51:09 And I just woke up, having "just rested a bit" around localtime-23; should "wake up" at 7- or 8-ish instead. <-- wait, you are supposed to be the one person in the channel with a normal sleeping schedule... 11:51:13 haha 11:51:28 yeah i wondered about that oo 11:51:28 oklopol: thx for letting me know about those symbolic thingies 11:51:31 it's really cute 11:51:33 oerjan: I have, it was just a mishap. 11:51:55 cheater: maybe someday i'll talk to you about the actual symbolic thingies themselves which i actually know something about, this is just their motivation 11:52:07 ok 11:52:09 so tell me 11:52:17 what are the actual symbolic thingies themselves? 11:52:20 it's like formal language theory ON CRACK 11:52:32 why do you need multiple dimensions 11:52:36 subshifts, that is, closed shift-invariant subsets of S^ZZ 11:52:44 what is a shift 11:52:54 multiple dimensions are nice so that linear maps give more interesting dynamics 11:53:07 shift means you take the point and shift the indices to the right 11:53:09 so 11:53:20 shift(x)_i = x_{i+1} 11:53:36 don't you mean shift(x_i) ? 11:53:44 no x_i is a symbol 11:54:01 you can't shift a symbol, you shift a "point", that is, an element of S^ZZ 11:54:05 what does shift(x)_i mean? 11:54:13 the ith coordinate of the shift of x 11:54:19 x is a point 11:54:25 hmmm 11:54:29 it just means shifting the whole point to the left 11:54:37 so 11:54:38 when you think of it as an infinite sequence 11:54:38 -!- sebbu3 has changed nick to sebbu. 11:54:48 [0, 1, 2] -> [2, 0, 1] ? 11:55:21 well no rotation since these are infinite. and i'm not sure you shifted in the right direction. 11:55:22 but so 11:55:42 ah yes ok right 11:55:54 the point ...01001011.0111... where . denotes where index 0 is, would shift to ...010010110.111... 11:56:05 so 12345... -> 2345... 11:56:17 ohh right 11:56:17 yeah. for a one-directional sequence 11:56:23 i always do two-directional 11:56:28 because that's cooler 11:56:30 because those have indices in Z? 11:56:36 yeah 11:56:46 so i feel like zorro 11:56:53 when i index 11:57:01 ok sooooo 11:57:21 that was the shift part, do you know what shift-invariant means? 11:57:25 i mean can you guess 11:57:40 with an S^ZZ which is {0, 1} we have only a few subshifts right? 11:58:03 S is {0, 1}. S^ZZ is every sequence of 0's and 1's. 11:58:04 ...0.0... and ...1.1... ? 11:58:05 -!- Frooxius has quit (Ping timeout: 245 seconds). 11:58:15 ah right yes 11:58:18 also 0101011101011110101000010101011 etc 11:58:27 that's called the full shift 11:58:29 why is that a subshift? 11:58:37 well do you see why it's shift-invariant 11:58:41 no 11:58:49 if you shift a point, it's still a point 11:59:01 shift-invariant means the _set_ of points is mapped to itself 11:59:09 the points themselves aren't 11:59:31 is the whole of S^ZZ shift-invariant 11:59:48 that's what confused you i suppose. if the points are actually fixed points of the shift, then they are exactly ...0.0... and ...1.1... as you said 11:59:51 yes 12:00:14 does it have proper subsets other than the trivial {,,,0,,,, and ...1...} which are shift-invariant? 12:00:16 because if you shift a point, it's some other point over the same alphabet S, and every point over S is in S^ZZ 12:00:32 yes. it even has closed shift-invariant subsets 12:00:35 a fuckload of them. 12:00:47 ^ul ((0)(1)):^!S(~:^:S*a~^~*a*~:^):^ 12:00:47 011010011001011010010110011010011001011001101001011010011001011010010110011010010110100110010110011010011001011010010110011010011001011001101001011010011001011001101001100101101001011001101001011010011001011010010110011010011001011001101001011010011001011010010110011010010110100110010110011010011001011010010110011010010110 ...too much output! 12:00:52 for instance, the set of points containing at most one symbol 1 12:01:00 * oerjan almost does that from memory now 12:01:01 that's closed and shift invariant 12:01:01 cool 12:01:10 why "at most"? 12:01:18 oh i see 12:01:18 ok 12:01:18 cheater: if we say exactly one, it's not closed 12:01:26 why is it not closed? 12:01:29 because you can shift the one to infinity, so to speak. 12:01:34 can you? 12:01:38 (morse-thue sequence; gives a subshift which is minimal) 12:01:51 yeah, see the topology here is given by the following metric 12:01:54 ah closed as in topologically closed 12:02:01 not closed as in closed under the function 12:02:08 ah yea 12:02:09 h 12:02:32 is it sufficient to say S has the discrete topology and S^ZZ the product topology? 12:02:40 that's what we're using 12:02:43 no 12:02:49 i don't know what the product topology is 12:02:50 okay then i'll give the metric 12:02:59 that's easier to work with maybe 12:03:07 OK!!!! 12:03:35 d(x, y) = 2^{-n} where n is the smallest absolute value of an index i such that x_i != y_i 12:03:52 so if you differ at the origin (at coordinate 0), then your distance is 1 12:04:10 for instance 12:04:16 erm 12:04:21 did i do that right... 12:04:46 yeah i think i did 12:04:51 or did you mean sum 12:04:55 no 12:05:02 so if i'm doing a shift the numbers might keep on jumping around wildly right? 12:05:29 you can also use d(x, y) = 1/{i + 1} where i is the smallest absolute value of a difference 12:05:34 cheater: yes! 12:05:46 i mean the distances 12:05:52 that could be used to create a new sequence 12:05:56 is that sequence somehow related 12:06:24 can you like 12:07:11 so you mean 12:07:16 let's say you have a sequence s 12:07:20 okay 12:07:39 and then you have a sequence of sequences {shift^k(s)} 12:07:51 oh i thought two would be enough 12:08:10 and then you define a sequence s' = {d(shift^k(s), shift^(k+1)(s)} 12:08:23 can you construct s knowing s'? 12:08:44 well no 12:08:50 why 12:08:50 erm 12:09:05 well 000 and 111 have the same s' 12:09:08 in the binary case, you may be able. 12:09:11 no, you cannot distinguish s from (1-s_i)_i 12:09:14 yeah 12:09:14 i think 12:09:18 but other than that 12:09:25 are there interesting cases when you can? 12:09:28 but it may be just symbol permutations 12:10:42 hm s' tells you exactly the coordinates where s and shift(s) differe, i think 12:10:43 yeah it's just symbol permutations 12:10:43 *-e 12:10:44 yeah 12:11:02 so indeed you can deduce everything other than total flipping 12:11:04 it seems you're still two seconds better at math 12:11:11 XD 12:11:35 oh right, i have to go to the shop 12:12:08 i think you could call ' the differential 12:12:09 since like 12:12:14 or the derivative 12:12:20 since it removes the unnecessary information 12:12:43 much like the derivative of a real function removes unnecessary information about the DC component 12:12:58 what does s'' tell you about s? 12:13:01 well the problem is the alphabet is not finite. unless you just take the information whether the bit changes. 12:13:26 i thought the alphabet was just {0, 1} 12:13:29 oklopol: i don't think it's just symbol permutations if it's more than binary 12:13:37 oerjan: yeah i meant binary 12:13:38 and S^ZZ is all sequences in that alphabet 12:13:40 since it only tells if neighbors are equal or not 12:13:42 no idea what happens otherwise 12:13:45 oh right 12:13:51 hmm 12:13:55 let's talk about binary first though 12:13:59 what does s'' symbolize? 12:14:00 yeah then that will probably not characterize it 12:14:32 cheater: s' is not the same kind of sequence as s, though - the elements of s' are reals, not symbols 12:14:34 well i think has something to do with xor in the binary case 12:14:48 oerjan: " well the problem is the alphabet is not finite. unless you just take the information whether the bit changes." 12:14:57 i guess you were more specific 12:14:58 i suppose that's not really a problem for your definition 12:15:06 ohhh 12:15:10 you mean for s'' 12:15:18 oklopol: being two seconds ahead is so much easier when i don't read what you write :P 12:15:20 yeah it shouldn't be a problem 12:15:59 cheater: so wait are you a mathematician 12:18:32 sorry i was right in the middle of a triceps set 12:18:36 no i just lift things 12:19:20 until you can lift even bigger things? 12:19:26 yes 12:19:32 i have a full set of weights 12:19:43 i hear the traditional method is to get a calf. 12:19:56 oerjan: oh sorry i forgot to add you need to decimate the result again 12:20:01 i.e. re-sample it 12:20:10 or in other words, truncate back to binary 12:20:23 by applying the transform from X to S 12:20:45 i didn't hear about any X. 12:20:54 ok sorry 12:21:14 -!- Phantom__Hoover has quit (Ping timeout: 244 seconds). 12:21:31 we have an X which is [0, 1) and we have a Z-action on it 12:21:42 we define two subsets, the upper and lower half 12:22:02 i don't think it makes sense to say s' is in X. 12:22:09 we take a point x0 in X which we then keep applying this Z-action to 12:22:25 this way we get s = {x_k, k \in ZZ} 12:22:26 right? 12:22:27 although you _could_ interpret 1/2^n as n 0's followed by a 1, or something. 12:22:39 are you following me so far? 12:22:45 never mind your interpretations 12:23:21 now let's say our partition is different 12:23:29 yes. however the problem here is that if you apply that transformation to each element of s', you get a sequence of sequences, not a single one 12:23:42 no i don't 12:23:42 so you cannot reapply ' to that 12:23:47 that's just your interpretation, i never said that 12:24:03 ok now let's say we have the sierpinski set on [0, 1] 12:24:03 ... 12:25:02 i'm sorry but i detect troll mode, and so i won't participate any longer. 12:25:11 i think you're full of shit 12:25:28 you don't follow and therefore you start hating 12:25:36 well done 12:25:49 pat yourself on the back 12:26:08 fine, it's possible, but i still suggest not angering me. 12:27:07 well, i hope you realize that displays of e-machoism are very basic intellectually 12:27:38 anyways, if you're not interested i'll go do something better with my time 12:27:40 bbl 12:32:52 -!- Frooxius has joined. 12:39:55 -!- Phantom__Hoover has joined. 12:51:49 my boobs are made for walking 12:53:02 how nice 12:53:47 my boobs are made for doing nothing 12:53:58 I lost my boobs 12:54:10 ion :( 12:54:16 ion: are you a breast cancer survivor? 12:54:36 Nah, they just went away as a side effect of losing weight. 12:55:09 I don’t miss them. I’ve never considered myself a huge fan of moobs. 12:55:30 -!- Frooxius has quit (Ping timeout: 240 seconds). 12:56:02 wait, you mean they can be made to go away again? 12:56:06 there is still hope! 12:56:27 a small one, given my general hate of physical exercise, but still 12:57:03 (also general hate of being hungry) 12:57:58 I don't think either of exercise or being hungry is necessary 12:59:09 I did no physical exercise and didn’t reduce the amount i eat (until that happened naturally as a consequence of losing weight). I didn’t even try to lose weight (although it was a welcome surprise). I just happened to find out about capsaicin’s effect on weight by it happening to me. 12:59:24 WOW! knowledge from wikipedia: 318 is the natural number following 317 and preceding 319. 12:59:34 You don’t say! 12:59:58 no, I don't, wikipedia do 13:00:02 does 13:00:45 > [succ 317, pred 319] 13:00:46 [318,318] 13:00:49 lambdabot seems to agree. 13:00:59 she does know stuff, that lambdabot 13:14:05 -!- Phantom__Hoover has quit (Ping timeout: 276 seconds). 13:15:05 Eating chili helps lose weight? Interesting. 13:15:44 now oerjan just has to choose between his hate of exercise, hate of hunger and hate of chili 13:19:16 Luckily I don't have to lose weight. 13:19:52 not your *own* weight 13:22:04 What's that supposed to mean? 13:22:45 are you asking me? 13:23:14 -!- oerjan has quit (Quit: Lost terminal). 13:23:18 Yes ;) 13:23:29 i don't know, it sounded like the thing to say. 13:25:37 http://www.sciencenews.org/view/generic/id/59930/title/Science_%2B_the_Public__Understanding_why_hot_peppers_are_slimming 13:26:43 -!- Frooxius has joined. 13:27:12 I was puzzled for a while when my weight started dropping, until i realized it coincided with the time i had gotten used to eating ~1M SHU stuff daily. Googling revealed stuff like that. 13:27:41 http://johan.kiviniemi.name/health/weight.png 13:28:01 you're finnish? 13:28:36 yeah 13:28:50 i weight 88 or something and i don't have boobs 13:29:14 Different height, different body structure, different muscle/fat ratio, … 13:29:35 how tall are you? you don't have the chart on capsaicin's effect on your height 13:29:42 i assume that went don't linearly 13:29:45 with weight 13:30:02 88kg? 13:30:06 *down 13:30:08 Or some weird american unit? ;) 13:30:15 kg obviously 13:30:17 i'm finnish too 13:30:51 1.76 m. (TBH, the moobs were quite insignificant, but not inexistent.) 13:30:51 what's SHU stuff 13:30:57 Scoville heat unit 13:31:00 i'm about 1.8 13:31:13 1.69, 65kg 13:31:13 okay 13:32:54 I love physical exercise as much as esoteric programming languages. 13:33:01 That's a good thingy. 13:33:04 ehm. 13:33:11 *dictionary* 13:33:27 attitude 13:34:05 i stopped jogging when winter. 13:34:15 ion: helsingki? 13:34:18 *helsinki 13:34:21 Tampere 13:34:44 university? 13:39:07 nope 13:39:18 work? 13:39:20 nope 13:39:23 high school? 13:39:29 nope :-P 13:39:36 just plain chillin'? 13:40:13 I was in TAMK for a year and worked a bit, but developed some health problems which put an end to that for now. 13:40:32 i'll take that as a "yes, BUT" 13:45:43 -!- Ngevd has joined. 13:51:52 -!- Ngevd has quit (Read error: Connection reset by peer). 13:56:06 -!- oerjan has joined. 14:10:30 My new esolang is coming along great \o/ 14:10:30 ¦ 14:10:30 ´¸¨ 14:10:54 myndzi: you should get that man to a hospital 14:10:57 bot? (\o/) 14:10:57 | 14:10:57 /| 14:11:06 I see. 14:11:19 -!- Ngevd has joined. 14:11:24 script 14:12:09 ^celebrate 14:12:09 \o| |o| |o/ \m/ \m/ |o/ \o/ \o| \m/ \m/ \o| |o| |o/ 14:12:09 fungot? 14:12:09 oerjan: don't do it right! but no, not in mine fibonacci numbers would take a look at 14:12:10 | | | `\o/´ | | | `\o/´ | | ¦ 14:12:10 /< |\ |\ | /| /| /`\ | /< /| ´¸¨ 14:12:10 (_|¯`\ /'\ 14:12:10 |_) (_| |_) 14:13:15 fungot: fibonacci, eh? 14:13:16 oerjan: which i'll try and do something new things get burned and you have some hope to actually debug it... 14:13:21 ^style 14:13:21 Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack pa qwantz sms speeches ss wp youtube 14:14:12 AAAAAAAAAAAAAAAAAAAAA chainsaw 14:14:22 fungot: fungot 14:14:22 mroman: you're doing the equivalent of `',x using only quasiquote?! :( 14:15:36 ^ul ((*)(*))(~:^~Sa~^*a*~:^):^ 14:15:36 ************************************************************************************************************************************************************************************************************************************************************************************************************************************ ...too much output! 14:15:38 oops 14:15:44 ^ul ((*)(*))(~:^~(/)*Sa~^*a*~:^):^ 14:15:45 */*/**/***/*****/********/*************/*********************/**********************************/*******************************************************/*****************************************************************************************/********************************************************************************* ...too much output! 14:15:50 ^help 14:15:50 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 14:16:31 -!- Phantom__Hoover has joined. 14:17:24 ^hs mapM id(" ">>["1234"]) 14:17:49 -!- Ngevd has quit (Ping timeout: 260 seconds). 14:18:01 sorry, implementing haskell in funge98 is still a bit beyond mankind 14:18:38 ^source 14:18:38 fungot: why so slow? 14:18:38 http://git.zem.fi/fungot/blob/HEAD:/fungot.b98 14:18:39 oerjan: http://www.dilbert.com/ comics/ ft/ 2005/ 02/15-feb-2005 is there a rough oklotalk spec anywhere?) 14:19:14 fungot: not in dilbert, i suspect 14:19:15 oerjan: ask questions, you have to be commands, and i suspect the deficiency is in unix, but isn't 14:19:32 -!- sebbu2 has joined. 14:19:32 -!- sebbu2 has quit (Changing host). 14:19:32 -!- sebbu2 has joined. 14:21:24 * oerjan concludes that url has more than spaces wrong with it 14:21:41 -!- sebbu has quit (Ping timeout: 276 seconds). 14:22:04 -!- Ngevd has joined. 14:34:42 -!- Ngevd has quit (Read error: Connection reset by peer). 14:52:36 -!- oerjan has quit (Quit: leaving). 15:13:21 -!- kallisti has quit (Ping timeout: 252 seconds). 15:15:16 -!- kallisti has joined. 15:15:16 -!- kallisti has quit (Changing host). 15:15:16 -!- kallisti has joined. 15:15:46 fungot: Are you slow? 15:15:46 fizzie: eval ( ( cons. 2) 15:15:54 Doesn't seem so slow. 15:17:10 fungot: pointful (.foo).(bar) 15:17:10 mroman: ( cadr fnord) doesn't faithfully preserve the meaning of " oklopol"? i thought it was apparent. 15:17:24 Never does what I ask him to :( 15:17:25 :D 15:17:48 fungot: Slap someone. 15:17:48 mroman: " friends of brainfuck", it was easy to implement malloc and free; or you are studying cs right? which area is your main interest? 15:18:07 If you want a sycophant, lambdabot is right there. 15:20:05 sycophant? 15:20:32 1. sycophant, toady, crawler, lackey, ass-kisser -- (a person who tries to please someone in order to gain a personal advantage) 15:21:23 I thought of psyo + elephant :D 15:21:26 *psyco 15:23:07 lambdabot: Are you some sort of psychotic pachyderm? 15:23:13 Quiet guy. 15:23:21 > 0 15:23:22 0 15:23:29 :type 0 15:23:36 > :type 0 15:23:37 : parse error on input `:' 15:23:48 :t you-mean 15:23:48 Not in scope: `you' 15:23:49 Not in scope: `mean' 15:24:12 ?type 0 15:24:13 forall t. (Num t) => t 15:24:36 Or that. 15:24:39 @. unpl pl \f g (a,b) -> (f a, g b) 15:24:39 (\ aa f -> (\ p w -> ((,)) (aa (fst p)) (f w)) >>= \ af -> snd >>= \ ae -> return (af ae)) 15:24:54 Likes to do things the hard way. 15:34:19 -!- Ngevd has joined. 15:36:25 -!- lifthrasiir has quit (Quit: maintenance). 15:50:41 -!- sebbu2 has changed nick to sebbu. 15:56:21 -!- Ngevd has quit (Read error: Connection reset by peer). 16:12:33 -!- derdon_ has joined. 16:15:39 -!- derdon has quit (Ping timeout: 252 seconds). 16:56:56 -!- Phantom___Hoover has joined. 17:00:17 -!- Phantom__Hoover has quit (Ping timeout: 276 seconds). 17:38:10 -!- itidus20 has joined. 17:41:21 -!- itidus21 has quit (Ping timeout: 245 seconds). 18:04:50 -!- sebbu has quit (Read error: Connection reset by peer). 18:04:58 starym 18:07:51 -!- sebbu has joined. 18:07:56 -!- sebbu has quit (Changing host). 18:07:56 -!- sebbu has joined. 18:08:52 -!- Klisz has joined. 18:16:28 -!- monqy has joined. 18:38:15 -!- centrinia has joined. 19:08:15 -!- ais523 has joined. 19:20:52 -!- augur has changed nick to Robbespierre. 19:21:10 -!- Robbespierre has changed nick to augur. 20:12:11 -!- lifthrasiir has joined. 20:16:07 -!- zzo38 has joined. 20:39:13 -!- oerjan has joined. 20:39:28 I thought you didn't know that already!! 20:39:45 -!- pikhq has joined. 20:40:00 -!- pikhq_ has quit (Ping timeout: 240 seconds). 20:42:19 Isn't it? 20:50:45 -!- Ngevd has joined. 20:51:09 Hello! 20:55:08 I so love pattern matching in my esolang <3 20:55:49 http://pastebin.com/i26ezt5W <- looks kinda neat 20:56:56 ooh, an esolang 20:57:44 Oh no, an esolang. 20:57:54 Nothing rare amongst here I guess :) 20:58:04 You'd think that, but no 20:58:17 Who would have thought. 20:58:34 Also, I think the programming tools on my graphical calculator are oddly suited for interpreting Numberwang 20:58:58 Ooh, a graphical calculator; which one? 20:59:23 It's a Casio, and that's as much as I can tell you off the top of my head 20:59:23 what, an esolang? no way that's on topic here. 21:00:21 Unless it's about magick or something, then it might be. 21:02:35 Ngevd: So how does one program them? I'm just aware of TI-BASIC (the silliest sort of BASIC), and old HP calculators' RPL thing vaguely. 21:03:05 You type in the program...? 21:03:19 It's got if statements and for loops and while loops and gotos 21:03:39 aaaahhh, gotos 21:04:21 C also has gotos, so that does not tell us much ;) 21:04:33 It's not C 21:04:46 Yes, I just wondered about the language. Whether it resembled something that exists. 21:06:34 Come to think of it, I guess the only two ways TI-BASIC actually resembles BASIC more than $generic_imperative_language are 1) the loads of limitations and 2) the "BASIC" in the name. 21:06:49 BASIC-like, I believe 21:07:10 -!- oerjan has set topic: Now open for Pirates | Take a trip to see our forts | Get your esoloot here! | Claims elliott shortage hurts productivity "Absurd, arrr" | Glorious optators "be worried, arrr" about missing treasure | Based on the power of clichés! | Spotted marsh elliott spotted in other marsh | http://codu.org/logs/_esoteric/. 21:07:16 TI-BASIC isn't BASIC it is a different programming language 21:08:29 http://en.wikipedia.org/wiki/Sharp_PC-1403 ftw. 21:08:30 (And RPL is vaguely Forthy instead.) 21:08:32 I have written programs for the TI-92. The programs run slowly, although if you know a few tricks you can speed it up a bit. 21:09:09 I've written some TI-BASIC "programs" for the TI-86, and the implementation sure is slow. 21:10:15 Then again, the TI-86 arithmetic routines are very very bloaty. (I've a friend who's poked them; and anyway ten-bytes-or-so BCD just won't be very fast anyhow.) 21:11:15 -!- Ngevd has quit (Read error: Connection reset by peer). 21:11:30 Isn't TI-92 that m68k one? 21:12:12 I know TI-96 is. Dunno about 92. 21:12:36 I recall that in some high-school exams the rules were that you could use a TI-86 but not a TI-92 because the latter did some symbolic derivation fluff. 21:13:07 fizzie: Yes; I think that was one reason, but there was also another reason being the TI-92 had a QWERTY keyboard. 21:13:15 So there were two reasons it wasn't allowed 21:13:39 A keyboard is a bit of a weird reason. 21:13:53 Err, wait. It’s been years since i used them and i utterly mixed up the numbers. Ignore what i said. 21:14:05 Yes but that is one of the reasons 21:14:21 (The symbolic derivation is another reason why it is disallowed) 21:14:26 that makes no sense, what does the keyboard give you that you can't already do? 21:14:45 TI-89 is the one in know to have a 68000. 21:14:49 olsner: Maybe if the exam is about keyboard layouts? 21:14:54 I don't know, but it is a reason 21:14:55 input is too damn fast on these new calculators, we need to slow people down! 21:15:07 Is there a calculator with APL? 21:15:20 That would really make me laugh :D 21:15:29 Make one! 21:15:30 92 apparently also has, according to Wiki. Also I think I might've confused the 92 and 89 too. 21:15:31 You could implement an APL mode to some of them. :-) 21:16:10 calculators are quite boring machines 21:16:53 Oh, 89 had the "vertical" format but still did that 68k thing? That must be a newer thing. 21:19:23 I got the TI-86 in... 96, I think, and chose it because of the allowed-in-the-exams status. (Well, and our class had a discounted-group-purchase event for the 86, too.) 21:19:49 fizzie: in exams in the UK, you have to wipe a calculator's memory before taking it into an exam 21:20:13 ais523: Same here, but the 92 has some symbolic-algebra in the ROM. 21:21:23 ais523: Also there's some code for the TI-86 that disables the reset functionality, but fakes the on-screen displays as if it succeeded, IIRC. 21:21:34 You could still upgrade the ROM to your own version. That is probably why Texas Instruments used the digital signatures on the ROM of one model 21:21:37 fizzie: haha 21:21:42 invented by some enterprising cheater? 21:21:46 fizzie: I know about that; I have read about it 21:22:00 ais523: I'm not sure I can figure out any other use case for it. 21:22:43 Once I cheated an exam by using the coughing code! So that other students can copy the answers off of me 21:22:44 Maybe "protect your calculators from resets done by siblings" or something. 21:22:53 -!- Sgeo has quit (Ping timeout: 276 seconds). 21:23:06 I love the effort some people spend to avoid spending effort to study for tests. 21:23:29 I also once read about a hardware modification that adds a "backup backup battery" since some teachers will steal the backup battery from your calculator 21:23:41 (Even outside of a test/exam) 21:24:44 -!- Sgeo has joined. 21:25:04 Once a teacher told us to drop the covers on the floor since apparently some students wrote the answers on them 21:25:21 There's a quasi-popular/simple "install a switch that overclocks the Z80 from 6 MHz to K MHz" mod for the 86. (I don't quite recall what K is; and it eats batteries faster + not all things work right when overclocked.) 21:25:22 zzo38: you aren't allowed to take calculator covers into exams in the UK 21:25:25 for that reason, I think 21:25:47 Someone could still write on the calculator itself; perhaps on the inside of the battery compartment 21:27:00 Apparently it goes up to around 15-18 MHz if you disconnect a capacitor. 21:27:00 Someone could cheat by making neural connections in their brain revealing the answers. 21:27:38 In what exams? 21:27:40 People have cracked the ROM key anyways so some people can install whatever program you want in ROM (including an entirely different operating system) 21:27:53 Usually you are allowed to take tons of materials to the exams. 21:28:03 mroman: A-level and university exams 21:28:06 Like handwritten summaries et al 21:28:27 Also I scratched my name into the aluminium foil that's behind the display inside the case, for a "prove it's mine in case of theft" scenario, though that never happened. 21:28:57 Also we had very few exams in in high-school-equivalent where you could bring any written material to. 21:29:19 in A-levels, sometimes there'll be written material assigned to you 21:29:27 Usually at university level you are allowed to use up to two pages of a handwritten summary 21:29:27 that's given to you inside the exam room so that you can't cheat by modifying it 21:29:28 I have heard of people that wrote on their entire body 21:29:33 -!- augur has quit (Remote host closed the connection). 21:29:33 and a formula collection, of course 21:29:44 -!- augur has joined. 21:29:51 *formulary 21:30:05 WTF 21:30:14 Why is this Install Updates button not working 21:30:41 And I'd think most of our university exams were closed-book ones, though there's exceptions. And sometimes provided material. 21:30:43 I think a daemon tried when I tried it before 21:31:00 What's the command-line thing? sudo apt-get upgrade? 21:31:36 I've just had my semester final exams 21:31:37 Sgeo: update, then upgrade 21:31:45 update downloads the updates, upgrade installs them 21:31:48 Also there's one particular book of math/physics/chemistry formulas that you can bring to the "matriculation examination", e.g. the thing at the end of high school that's often used for university entrance score calculations. 21:32:03 Ok 21:32:05 And in every exam we were allowed to use at least 2 pages of handwritten stuff. 21:32:17 in some even up to ten pages. 21:32:23 Look like things are downloading from the command line 21:33:22 -!- Ngevd has joined. 21:33:32 Cultural differences, I assume; I don't recall any handwritten-notes-allowed exams offhand, and I'd think there were a total of at most five in the... however many exams there were in total. Certainly at least 50. 21:33:34 I had one exam where we were allowed to write whatever we wanted on an index card and bring it into an exam (there were a few restrictions, such as the size of the index card, you could only use one side, and you are not allowed to bring a magnifying glass, and it must be hand-written; although I assume it is OK to write it in code, or small enough that even though you can read it, the teacher can't). 21:33:39 Although those summaries are usually not that useful. 21:34:10 Nothing that you can write in a summary is going to make you smarter 21:34:17 I think I have asked the teacher if it is OK to write in code or very small; he said it is OK as long as a magnifying glass is not required 21:34:24 -!- Ngevd has quit (Read error: Connection reset by peer). 21:34:36 You could write your name, if you forget it often. 21:35:22 :) 21:35:47 I'd rather write the name of the don on to the index card. 21:35:54 Aw, the web-thing can only count course credit points, not number of courses. (Not that all of them had exams.) 21:36:03 In one exam we were allowed both sides of a letter-sized paper. After writing everything on there, I had more than half of the paper left blank, so I copied the questions from the exam onto it. 21:37:43 We are usually (in university, anyway) allowed to take the exam paper out; there's a student-run (the CS student guild, actually) archive of scanned/retyped old exams. 21:38:25 We only have access to the exams of last semester 21:38:32 because there is no student-run archive ;) 21:39:11 Bah, it doesn't print totals either, But I'm sure there's at least a thousand. 21:41:30 8516 exams, says a Perl oneliner. 21:42:24 It'd be an interesting exercise to quantify the mean amount of duplicate questions in one. 21:43:04 Quite a lot of exams rotate old questions back in instead of constantly inventing new ones. 21:45:13 -!- Ngevd has joined. 21:45:18 The SQA offers past papers online, although I'm not sure how far back. 21:47:34 There are older, smaller, usually one-topic on-paper exam archives at the offices of the various student organizations. The web-thing is relatively recent. 21:50:31 -!- Ngevd has quit (Quit: Goodbye). 22:08:45 -!- Klisz has quit (Read error: Connection reset by peer). 22:10:35 -!- Klisz has joined. 22:18:10 Once, on the final question of an exam, I did not know the answer of that final question and neither did the student next to me, so we both tried to cheat off of each other. (This was only for the final question, however. Neither of us cheated before then) 22:20:02 was the question "What is infinite recursion?" 22:22:01 oerjan: No. I do not remember what the question was, but I couldn't figure it out and neither could the student next to me. 22:29:34 I do not remember what class it was either, but I do remember we were permitted to use a spreadsheet 22:32:01 kallisti, updoot 22:32:06 Phantom___Hoover, uppost 22:39:12 Do you know if there is some way compiling Haskell and/or LLVM codes into Glulx virtual machine (in the case of Haskell, possibly using Template Haskell for something)? 22:57:31 I would like to write a text adventure game using Haskell, and make a Glulx file from it. 22:57:42 I also like to have LLVM to Glulx, for different reason. 23:12:18 -!- nooga has quit (Ping timeout: 248 seconds). 23:21:13 -!- augur has quit (Remote host closed the connection). 23:32:50 -!- Ngevd has joined. 23:36:58 -!- Ngevd has quit (Read error: Connection reset by peer). 23:37:00 -!- Taneb has joined. 23:37:49 -!- Taneb has changed nick to Ngevd. 23:42:38 -!- Ngevd has quit (Ping timeout: 276 seconds). 23:47:22 -!- oerjan has quit (Quit: Lost terminal). 23:49:01 -!- oerjan has joined. 23:52:44 -!- ais523 has quit (Remote host closed the connection).