00:03:08 not that i remember. 00:12:47 ?type safePerformIO 00:12:48 Not in scope: `safePerformIO' 00:15:19 ?let safePerformIO :: IO a -> IO a; safePerformIO = id 00:15:21 Defined. 00:19:42 saferPerformIO :: IO a -> IO (IO a) 00:19:49 safestPerformIO :: IO a -> Fix IO 00:20:18 discussing haskell on an esoteric languages channel... seems legit ;-) 00:20:32 unperformIO 00:21:08 Fix IO is a good type 00:21:16 `relcome blotter 00:21:17 blotter: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 00:34:23 looks like the drought here will finally end tomorrow 00:34:31 jafet: safePerformIO :: IO a -> IO a; safePerformIO = unsafeCoerce 00:36:14 unsafePerformState :: State s a -> a 00:36:19 genericSafePerformIO :: IO a -> IO b 00:38:27 :t forever 00:38:28 Monad m => m a -> m b 00:40:27 copumpkin: is it good for something, or just good in general? 00:40:35 just good in general! 00:40:45 maybe Free IO is more useful 00:40:47 you should write a library for dealing with it 00:40:53 pfft, that one's boring 00:41:15 ?let kindaSafeIO :: IO (IO a) -> IO a; kindaSafeIO = join 00:41:16 Defined. 00:41:26 forever' :: Fix IO -> IO b 00:42:23 forever? i hardly know'er! 00:42:38 copumpkin: let's go with Cofree IO then 00:42:46 ok :) 00:44:17 Cofree IE IO 00:45:16 -!- tromp_ has joined. 00:46:29 Free Coffee 00:51:17 -!- heroux has quit (Ping timeout: 272 seconds). 00:54:29 -!- blotter has quit (Ping timeout: 248 seconds). 00:55:01 -!- nys has quit (Quit: quit). 00:56:34 Cofree IO would have one response and then the IO action which can continue, to give you another Cofree IO, so you can stop in between each step. 01:04:23 yes 01:05:22 isnt that a continuation? 01:05:38 I think, not quite 01:06:27 Sounds like a generator 01:06:48 Sgeo: Yes, perhaps that is what it is more like. 01:06:49 sounds like a state machine 01:26:56 -!- Frooxius has quit (Ping timeout: 245 seconds). 01:36:51 -!- nooga has quit (Ping timeout: 252 seconds). 01:45:11 -!- nooga has joined. 01:58:46 -!- nooga has quit (Ping timeout: 260 seconds). 02:06:17 -!- blotter has joined. 02:11:37 -!- Phantom_Hoover has quit (Quit: Leaving). 02:18:51 Considering the usage pattern of functors in lens, would it be so terrible to have a container that also contained the fmap function to use on it? 02:25:26 -!- Frooxius has joined. 02:27:27 -!- blotter has quit (Ping timeout: 252 seconds). 02:30:33 Sgeo: If you implement lenses as a setter and getter, you don't need fmap at all 02:31:15 FreeFull: but then how do I implement prisms, and can I even implement traversals? 02:31:44 That is what I did at first, implement a lens as a setter and getter, although at the time I didn't know any other way and also didn't know it was called a "lens". 02:32:09 Sgeo: Not sure, figure it out 02:36:48 -!- blotter has joined. 02:39:26 -!- Frooxius has quit (Ping timeout: 245 seconds). 02:44:24 well hello oerjan, thanks 02:45:07 does anyone here have any more information on Feather than the wiki provides? 02:46:38 except for ais523 who refuses to talk about it, not much. 02:48:15 there may be something hidden in the logs, unfortunately our bot-based search of them has broken. 02:52:05 -!- CADD has joined. 02:52:28 -!- CADD has changed nick to Guest94082. 02:52:43 -!- Guest94082 has quit (Client Quit). 02:53:30 -!- Sorella has joined. 03:01:37 k 03:04:43 FreeFull: I also feel like van Laarhoven lenses can help me avoid making mistakes, like having a lens be a pair of setter+getter instead of modifier+getter 03:05:03 With the former, modify would be in terms of set+get, but I don't want to force the existence of get 03:05:13 So I handled that, but I don't know what else I may be missing 03:07:15 Sgeo: Well, you can always implement set in terms of just modify, so you should go with that 03:07:26 FreeFull: and that's what I did do 03:07:35 But I'm not sure what other pitfalls I have to be careful of 03:07:52 Not sure if there are any data structures for which set would make sense but modify wouldn't 03:08:27 Even if there are some, then modify wouldn't be used except as a "const" function anyways. 03:10:41 I suppose a data structure which doesn't actually store a value would qualify 03:12:09 I want prisms to exist, I think. Not sure if I need traversals 03:12:22 mapped already exists in terms of my getter/modifier pair 03:12:41 So data Phantom a = Phantom 03:15:15 Modify for that would have to use bottom in Haskell, and in a strict language, I don't know what it'd do 03:15:29 FreeFull: um no, modify works perfectly well 03:15:52 it just happens never to call the function to modify with 03:16:46 oerjan: Oh, I suppose that'd work 03:17:00 just like map with an empty list 03:17:36 Yeah, nevermind 03:17:49 I can't think of a data structure for which set is valid but modify isn't 03:18:11 -!- yorick has quit (Remote host closed the connection). 03:27:37 -!- HackEgo has quit (Ping timeout: 272 seconds). 03:27:54 -!- HackEgo has joined. 03:34:34 I should continue attempting to write my struct-lens macro 03:34:48 Even if I change implementations later, the macro would still be useful 03:36:01 The funny thing is, I know how to write modify but not get 03:38:56 -!- Tod-Autojoined has joined. 03:39:17 -!- TodPunk has quit (Read error: Connection reset by peer). 03:46:02 That data Phantom a = Phantom; just has fmap do nothing, join do nothing... A data of the same structure is also called "Proxy", or "Finalize" (which is what I called it, due to reasons having to do with category theory). 03:46:32 For any final object of any category, there is a corresponding Finalize monad on that category, isn't it? (And, for initial objects, a corresponding Initialize comonad.) 04:05:13 -!- Sorella has quit (Quit: It is tiem!). 04:08:11 -!- blotter has quit (Ping timeout: 245 seconds). 04:09:27 So, Roy's deadly to undead energy thing... what if Durkon is standing too close when the sword is used? 04:12:31 Then maybe he will be dead 04:16:08 `coins 04:16:09 beforecoin impcoin lingarcoin nybernmcoin lllcoin delcoin wherpiloventecoin 0x25666thicaencyklan/mcoin 1lemationecoin rincoin .yacuablencoin etacoin mentinrcoin choncoin condicoin hannencoin quancoin worbeitcoin spoolfebowlcoin kayakcoin 04:16:41 -!- blotter has joined. 04:17:10 lllcoin -- the proof of work is finding a short, nearly orthogonal lattice basis? 04:19:28 How long before the arrival of etacoin 04:21:28 -!- luserdroog has quit (Ping timeout: 245 seconds). 04:29:40 how's that work 04:31:06 eddacoin. proof of work is done in the form of extemporal sagas 04:31:34 https://twitter.com/yesterbits/status/434827571008925696/photo/1/large anyway 04:39:51 -!- douglass_ has quit (Ping timeout: 265 seconds). 04:49:06 -!- douglass_ has joined. 05:08:57 I guess at least some use cases for non-lens things in Haskell might be unnecessary in Racket, with a bit of imperative magic? 05:09:24 Well, hmm, even if strictly unnecessary, could still be convenient 05:10:20 Would rather have a 'how many items in this collection' lens than need to "modify" the collection with a thing to collect the answer 05:10:28 "lens" 05:10:43 beep boop 05:10:45 `coins 05:10:47 malcoin waitcoin sokovcoin kelxircucoin miccoin fugicoin locktrycoin boilcoin wadcoin beforecoin quoicoin friedcoin selacoin lazepterixcoin versedcoin livingcoin synccoin proriggethisesocoin protatiumbradacronymcoin realcoin 05:12:20 http://www.cnn.com/2014/02/13/tech/innovation/termite-robots-aaas/index.html?hpt=hp_bn5 05:12:29 What's the point of avoiding the centralized blueprint? 05:12:37 i'm sure i've seen beforecoin before 05:13:14 Kentucky Friedcoin 05:13:35 me gives boily one boilcoin 05:13:47 * Sgeo forgot how to /me, apparently 05:13:56 Sgeo, can you tell me why I am awake. 05:14:02 And apparently listening to Bloc Party. 05:14:11 Probably because you're not asleep 05:15:00 -!- tromp_ has quit (Remote host closed the connection). 05:15:03 -!- augur has quit (Remote host closed the connection). 05:15:31 -!- augur has joined. 05:15:34 -!- tromp_ has joined. 05:16:25 -!- augur has quit (Read error: Connection reset by peer). 05:16:31 -!- augur has joined. 05:19:54 -!- tromp_ has quit (Ping timeout: 260 seconds). 05:25:47 -!- Tod-Autojoined has quit (Ping timeout: 260 seconds). 05:27:11 How would a hardware programming language be designed for quantum computers? 05:39:32 i am sure that there are already papers on this 05:40:26 i suppose that instead of specifying a block of logical equation "assignments" that happen at once, you would specify any self-adjoint operation on whatever subset of "variables" you like 05:40:55 unitary, not self-adjoint hth 05:41:02 is it 05:41:28 yep 05:43:39 zzo38: it's hard to think about compiling a quantum HDL because nobody quite knows what physical form a quantum computer will take or what its primitive operations will be 05:44:06 sounds like a job for rampant speculation 05:44:27 it's like doing boolean logic but you don't know whether it will synthesize to CMOS gates or pneumatic tubes or DNA linking up 05:44:47 (maybe it is less uncertain now; my understanding is sketchy and may be years out of date) 05:45:24 anyway any universal quantum computer will be able to implement a CNOT gate, and you can compile any quantum circuit to CNOT gates + rotations, but this may not be a natural or efficient way to implement your quantum HDL 05:46:19 are there any dna computer vhdls 05:48:36 -!- nooodl has quit (Quit: Ik ga weg). 05:53:52 kmc: Yes I would think that you would specify self-adjoint operations, but that still doesn't explain much about how timing, measurements, etc would be specified; well, CNOT gates and rotations can be built-in primitives even if you can define your own things too 05:54:03 * kmc nods 05:54:27 I mean any quantum computer for the forseeable future is going to be kind of a quantum coprocessor to a conventional computer 05:54:46 because a conventional computer costs like $20 and works at room temperature 05:54:55 which makes them better for a lot of things 05:55:39 Yes, but I am trying to think of how to do it with hardware designing, rather than software (already QCL and stuff exists), and to allow to combine quantum with classical in one file 05:56:00 And yes, I too think it is supposed to be unitary rather than self-adjoint, but I am not a real physicist so I don't really know 05:56:16 so probably timing and measurement will be dictated by the classical part 05:56:23 you'll specify a measurement basis in the quantum HDL though 05:56:34 i should really read one of these papers instead of speculating but that sounds less fun 06:04:35 Something quite odd just happened 06:04:45 Apparently the lock on my door does not work 06:07:50 -!- oerjan has quit (Quit: nite). 06:09:15 did you have to bust your way out 06:10:31 No, but someone walked in 06:11:44 while you were in a... compromising position? 06:11:59 No, but she was in her underwear and seemed somewhat confused 06:13:05 I asked her politely to leave 06:13:40 does your door look like a bathroom 06:14:12 In as much as a door with my name on it can 06:14:35 My name is not "Toilet", "Ladies'", "Gents'", or any variation thereof 06:15:17 whiz palace 06:15:42 isn't your name dutch, though 06:15:48 perhaps she couldn't read dutch 06:16:00 SW∃DíSH TJÖILETŜ 06:31:55 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 06:38:42 -!- oklopol has joined. 06:40:29 -!- password2 has joined. 06:45:41 -!- luserdroog has joined. 06:50:52 -!- nisstyre has joined. 07:16:15 -!- blotter has quit (Ping timeout: 272 seconds). 07:23:24 break out your busted too-clever postscript code! I wrote a debugger (requires and interpreter, like gs): https://github.com/luser-dr00g/debug.ps 07:32:30 I somehow thought Nazi Temple of Doom would be more exciting... 07:33:54 And how is it I've never heard of Battle Beyond the Stars? Robert Vaughn AND Hannibal from the A-Team??! smokemifygotem 07:38:46 Are the quantum operations supposed to be triggers or what else? That part I don't quite understand. 07:39:02 Although, I do (mostly) understand what the operations are. 07:45:39 I missed the beginning. 07:51:06 I was reading in here http://math.ucr.edu/home/baez/rosetta/rose3.pdf that quantum operations are modifiers on the hilbert space. 07:51:34 All I can say is that I know what each of those words means individually. 08:37:21 -!- password2 has quit (Ping timeout: 245 seconds). 08:48:47 -!- conehead has quit (Quit: Computer has gone to sleep.). 09:12:48 -!- password2 has joined. 09:43:41 -!- shikhin has joined. 09:45:56 -!- shikhout has joined. 09:48:57 -!- shikhin has quit (Ping timeout: 252 seconds). 09:48:57 -!- shikhout has changed nick to shikhin. 09:59:18 -!- password2 has quit (Read error: Connection reset by peer). 10:11:58 -!- CADD has joined. 10:11:58 -!- CADD has quit (Client Quit). 10:51:31 -!- MindlessDrone has joined. 11:03:36 -!- CADD has joined. 11:04:00 -!- CADD has changed nick to Guest34605. 11:05:15 -!- password2 has joined. 11:05:28 -!- nooga has joined. 11:07:59 -!- hexagon has joined. 11:08:07 hi 11:08:12 I need to check if a character is equal to another character in BF 11:08:26 -!- CADD__ has joined. 11:08:39 -!- CADD__ has quit (Client Quit). 11:08:40 I found this https://gist.github.com/wjessup/4688874 but I can't figure out how to copy cell 1 to cell 2 without zeroing cell 1 11:08:41 -!- Guest34605 has quit (Ping timeout: 272 seconds). 11:11:38 hexagon: you typically need some auxiliary cell. [->+>+<<] duplicates a value. 11:11:58 ah, thanks 11:12:01 you want to copy instead of move? 11:12:21 yeah, because that gist says to have 3 as value of all three cells 11:12:32 (that one duplicates to the next two cells assuming they are initially zero) 11:18:51 ~help bf 11:19:06 `help bf 11:19:06 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 11:23:19 -!- nooga has quit (Ping timeout: 252 seconds). 11:38:50 -!- nooga has joined. 11:41:06 Is dealing with multiple values in Scheme supposed to be painful? 11:41:32 I'm thinking of maybe transliterating Traversals into something like 'lens that gets and modifies multiple values', but I have no idea if that's sane 11:42:05 In either the 'this is equivalent to traversals' or 'this will be nice to do in Racket' sense 11:42:53 -!- password2 has quit (Ping timeout: 246 seconds). 11:44:26 Oh, the obvious way is call-with-values sending the values to list 11:46:35 There's http://srfi.schemers.org/srfi-8/srfi-8.html for making multiple values rather less painful. 11:48:01 I think that's just let-values in Racket 11:48:06 (Which also has define-values) 11:48:26 Which are all perfectly well and good except they assume you know how many values are incoming 11:48:29 I didn't think let-values supports the "rest" syntax thing. 11:48:38 Well, you don't need to know that for receive. 11:48:45 Since it's analogous to lambda argumets. 11:48:45 Oh, you're right, oops 11:49:46 Racket does ship with SRFI-8 11:50:02 But I think I hate let-like forms 11:50:36 #lang s-exp srfi/provider srfi/%3a8 11:50:48 :/ 11:50:48 (let ((l (call-with-values (lambda () (values 1 2 3)) list))) ) -> (receive l (values 1 2 3) ), pretty much. 11:51:12 That does not make me more appreciative of let-like forms 11:51:31 I think I'm inclined to worship internal defines 11:53:51 https://github.com/plt/racket/blob/master/pkgs/srfi-pkgs/srfi-lite-lib/srfi/8/receive.rkt 11:54:05 Doesn't use the reference implementatiion, it defers to let-values 11:54:42 -!- nooga has quit (Ping timeout: 260 seconds). 11:56:57 (When it can) 12:00:42 Huh. I don't remember syntax-rules, will (receive (var ...) [...]) match (receive (a b . c) [...])? 12:02:11 It shouldn't, I ... think 12:02:32 Actually, hmm, I can see why that's an interesting question 12:03:12 Maybe I should avoid using body ... for bodies so much? Because ... hmm 12:03:24 The implementation is defective if it does, since (let-values (((a b . c) [...])) [...]) is not allowed. 12:03:29 But maybe it doesn't. 12:03:58 Yeah, the parts only match a proper list. 12:06:01 So yeah, multiple value get returns to emulate traversals... in case the traversal 'gets' just one element, it doesn't need special processing, which fits more closely in a dynamically-typed language than requriing something for that case would 12:06:40 Wait, I can't actually enumerate all of a real traversal's values, can I? 12:06:41 hmm 12:18:50 -!- yorick has joined. 12:21:46 why is this code not returning different values for input "a" and "ab"? 12:21:48 >,>,>[[-]>>[-]+<<]>[[-]>[-]+<]>>[-]+<[>-<]>. 12:21:55 idea taken from http://www.codeproject.com/Articles/558979/BrainFix-the-language-that-translates-to-fluent-Br equality code 12:22:05 I'm using http://mazonka.com/brainf/bfdebug.html, tried ideone too 12:22:19 erm, "aa" and "ab", sorry 12:23:18 hmm, wait 12:23:32 maybe I need more code, I'm actually supposed to already set less and more first 12:23:35 *facepalm* 12:28:31 I'll mess with that later, bbl 12:40:47 -!- Phantom_Hoover has joined. 12:46:46 -!- nooodl has joined. 12:49:40 -!- nooga has joined. 12:50:43 -!- Tritonio has joined. 12:56:23 -!- Frooxius has joined. 13:16:41 -!- boily has joined. 13:16:49 -!- metasepia has joined. 13:34:39 -!- password2 has joined. 13:43:54 hexagon: Assuming a zero-initialized tape, your >,>,>[[-]>>[-]+<<]>[[-]>[-]+<]>>[-]+<[>-<]>. reduces to >,>,>>>>+. no matter what the input, as all the [] blocks will be skipped. 13:44:19 (Perhaps that's what your "already set" comment meant.) 13:46:52 Anyway, something like (untested) ,>,[-<->]+<[>-<[-]]>[ code here if two characters were equal ] is the obvious destructive compare-two-characters snippet. 13:47:59 In words, that's "input two characters, subtract second from first; set a flag; if result of subtraction was nonzero (i.e., characters not equal) clear the flag; do something if flag still set". 13:52:53 What are you trying to do? 14:09:18 -!- Sorella has joined. 14:10:49 -!- tromp_ has joined. 14:33:48 good yogurt morning! 15:16:06 -!- nooodl has quit (Quit: Ik ga weg). 15:38:17 -!- nooodl has joined. 15:49:03 -!- shikhin has quit (Ping timeout: 252 seconds). 15:50:18 -!- itsy has quit (Ping timeout: 252 seconds). 15:54:50 -!- boily has quit (Quit: TILED CHICKEN). 15:54:58 -!- metasepia has quit (Remote host closed the connection). 16:01:14 -!- oerjan has joined. 16:02:15 -!- shikhin has joined. 16:12:57 Are the quantum operations supposed to be triggers or what else? That part I don't quite understand. <-- you can think of them as reversible assignments on the qubits. e.g. a^= b or a+=b is a valid quantum operation if a and b are distinct qubits, as are the operations that rotate the quantum phase of a qubit. 16:16:17 and also an operation might change more than one qubit. 16:24:36 -!- Zerker has joined. 16:35:05 -!- Phantom_Hoover has quit (Quit: Leaving). 16:35:23 -!- Phantom_Hoover has joined. 16:41:03 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 16:46:10 -!- Zerker has quit (Quit: Colloquy for iPad - Timeout (10 minutes)). 16:48:08 -!- luserdroog has quit (Ping timeout: 245 seconds). 16:49:49 -!- tertu3 has joined. 16:49:49 -!- tertu3 has changed nick to tertu. 16:59:21 -!- nooga_ has joined. 17:01:54 oerjan: Yes, I can clearly see that an operation might change more than one qubit 17:01:57 -!- tromp__ has joined. 17:06:26 -!- Phantom_Hoover has joined. 17:06:44 But I don't see where such assignments can go other than in triggers, and maybe you might sometimes want to put them elsewhere. 17:07:31 what are triggers? 17:08:14 -!- nooga has quit (*.net *.split). 17:08:14 -!- HackEgo has quit (*.net *.split). 17:08:15 -!- clog has quit (*.net *.split). 17:08:15 -!- glogbackup has quit (*.net *.split). 17:08:15 -!- tromp has quit (*.net *.split). 17:08:15 -!- fungot has quit (*.net *.split). 17:08:18 Trigger on a (classical) clock edge. 17:08:53 right, that would seem a plausible way 17:09:54 however the physics are still up in the air. if the qubits were e.g. stored in _moving_ particles, then the assignments might happen when they arrive at some destination. 17:10:25 Consider the syntax for triggers on classical signals in HWPL: TRIGGER vec SET vec TO vec [WHEN bit]; and in Verilog, you use "always@(posedge clk)" instead. Similar thing could be done for quantum registers? 17:10:55 but if they were stored in some silicon-like material, then a system more similar to current VLSI might be more likely. 17:11:10 If the assignments are happening when they arrive, that can work too if you put in the relative (or absolute) delays for them 17:11:46 -!- HackEgo has joined. 17:12:47 -!- nooodl has quit (Quit: Ik ga weg). 17:13:21 How is a system more similar to current VLSI, exactly, in quantum computing? 17:14:08 well in that the quantum gates could be put as physical devices on chips 17:15:37 aaronson has been writing about this more or less toy system called boson sampling, which could be based on light and mirrors. 17:16:01 although that wouldn't seem to be full quantum computing 17:16:34 but it's still of some interest since it might still have some superclassical abilities 17:16:53 and might be simpler to construct than a full quantum computer 17:17:24 i understand that the intended error correction scheme for a quantum computer would make circuits thousands of times larger 17:17:34 *a full quantum computer 17:19:28 If quantum gates are put as physical devices on chips, do they need to be activated or something? Or would it be continuous as a signal passes a gate? (Even in such a case, they would still need to be activated somehow, I think). What if error correction is also explicitly programmed in using hardware programming languages? What about entanglement with external devices (which might be used in cryptography, for example)? 17:19:47 And then there needs to be the way to specify measurement, and several other things like that. 17:20:30 Consider maybe something like this: TRIGGER vec OPERATE matrix ON qureg [WHEN bit]; 17:20:39 Would that be? 17:20:57 i'd imagine they'd _try_ to construct it as close to a "normal" chip as they can, simply for the advantage of being able to use mostly known technology. 17:21:11 (with mass production advantages etc.) 17:21:32 Yes, but I don't know how you would do that. 17:22:03 neither do i! they haven't even decided what's best to make the qubits of yet! 17:25:07 Nevertheless, quantum programming languages exist. 17:25:54 yes. i think they mainly make the assumption that you can combine "pure" gates for unitary matrices mathematically 17:26:53 and don't worry about how that would be implemented physically. 17:31:56 -!- Tritonio has quit (Ping timeout: 252 seconds). 17:32:44 -!- oerjan has quit (Quit: Later). 17:34:48 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds). 17:44:03 -!- clog has joined. 17:44:31 -!- password2 has quit (Ping timeout: 272 seconds). 17:44:53 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 17:46:00 -!- Shiva has joined. 17:46:19 -!- nisstyre has joined. 17:49:52 -!- Phantom_Hoover has joined. 17:52:58 -!- JesseH has joined. 17:54:08 Abacus lang 17:54:09 -!- Phantom_Hoover has quit (Remote host closed the connection). 17:58:30 -!- nooodl has joined. 18:00:12 -!- Phantom_Hoover has joined. 18:06:02 What is a "skierized vehicle"? 18:06:45 Oh, apparently it just means "equipped to transport skis". 18:11:15 -!- shikhin has quit (Quit: Leaving). 18:24:54 -!- Phantom__Hoover has joined. 18:26:43 -!- blotter has joined. 18:28:49 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 18:30:12 -!- Sprocklem has joined. 18:34:34 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 18:37:24 -!- nisstyre has joined. 18:38:00 -!- nisstyre has quit (Client Quit). 18:39:52 -!- nisstyre has joined. 18:57:44 Florida Man Accidentally Shoots Himself With Stun Gun While Trying to Rob Radio Shack He Also Works At 19:01:59 "He said he needed money to pay for car insurance and his cell phone bill." 19:02:04 That's reasonable. 19:02:31 hi, I'm trying to make a BF program to print input in reverse, but it's only outputting an ASCII NUL: >,[>,][<.] 19:03:01 (yeah, I did realize that < will make it not print the last character, I'll fix that) 19:04:10 ][ is pointless 19:04:13 after a ], the current cell is 0 19:04:18 therefore the following loop is always skipped 19:04:47 Yes, that is true, ][ is useless 19:04:48 oh, of course 19:04:56 (Except possibly to make up a comment) 19:04:59 (spoiler: >,[>,]<[.<]) 19:05:16 :) 19:05:28 ah, thanks! 19:13:13 http://www.theguardian.com/books/2014/feb/12/ancient-viking-code-deciphered-runologist-jotunvillur 19:14:34 This has got to be one of the most Viking cities anywhere 19:14:37 Runologist sounds like a fake word 19:15:36 "writing his doctorate on cryptography in runic inscriptions from the Viking Age and the Scandinavian Middle Ages" wow 19:16:15 that guy is so fucked on the job market 19:17:11 maybe he is going to stay on academia? 19:17:43 "maybe" 19:18:10 I tried 19:18:14 didn't work out so well 19:18:21 well, he could probably get a pretty good book deal out of this 19:18:30 tried to get a book deal? 19:18:37 -!- Shiva has quit (Quit: Quitte). 19:19:24 I am trying to write a physics book 19:19:31 But I doubt it will sell well! 19:19:34 Or even get written 19:19:54 you should have tried something more popular, like vikings, or SMS. 19:22:01 what kind of physics 19:22:35 Theoretical 19:22:45 I have plenty of physics book ideas 19:22:53 One of them is called "What the fuck is spin" 19:22:57 Because seriously 19:23:03 That is a book I would have liked to have 19:23:13 Most books do not explain it well at all 19:30:04 -!- password2 has joined. 19:41:13 -!- blotter has quit (Ping timeout: 252 seconds). 19:45:43 -!- conehead has joined. 20:00:03 -!- password2 has quit (Ping timeout: 272 seconds). 20:00:30 -!- MoALTz has joined. 20:01:55 -!- Sprocklem has quit (Quit: Leaving). 20:02:53 -!- Sprocklem has joined. 20:05:17 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:17:31 I figured out, not only BULBASAUR [Lv15] wins against MEWTWO [Lv53], but WEEDLE [Lv15] does too. As far as I can tell, any other card isn't guaranteed to win. 20:22:50 -!- TodPunk has joined. 20:23:41 -!- prooftechnique has joined. 20:25:32 -!- password2 has joined. 20:28:22 -!- fungot has joined. 20:28:29 ^show rev 20:28:29 >,[>,]<[.<] 20:33:14 Slereah__: writing popular physics books? good 20:35:27 Who said anything about popular 20:36:44 `coins 20:36:46 cteditierdneywaterwcoin trackecoin anyplecoin latliscoin punivatumcoin bytecoin muzcoin xigxcoin geslecoin mismcoin novischesnacecoin smncoin threakcoin exeranccoin gcocoin nusaitzcoin galentincoin dzintycoin sationcoin preficoin 20:37:21 cnidariacoin 20:38:15 bytecoin 20:38:53 gelatincoin 20:39:25 gelatocoin 20:39:43 dogecoin is the only coin 20:39:53 Slereah__: what the fuck is spin, anyway? 20:40:43 kmc : Buy my book and you will knooow 20:40:48 But anyway 20:41:01 Spin is neither a relativistic concept nor a quantum one at its core 20:41:51 It's one of the two conserved current associated with rotation 20:41:59 The other being the angular momentum 20:43:05 -!- password2 has quit (Ping timeout: 265 seconds). 20:55:09 okay 20:55:17 how do i know how much spin something has 20:55:22 elementary particles have a fixed amount right? 20:56:29 does anybody here knows any way of interpreting haskell on android? 20:57:15 The spin is linked with what kind of field you have 20:57:27 Like if it's a scalar field or a vector field or something else 20:58:57 http://www.reddit.com/r/Bitcoin/comments/1y1g7l/i_have_a_bitcoinfession_and_a_plea_dont_gamble/cfgjhos welp 21:01:19 i have a dogecoinfession 21:05:32 `coin 21:05:32 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: coin: not found 21:05:35 `coins 21:05:36 poincoin scomesocoin regiccoin direcoin evercoin anycoin hamcoin jugcoin zetanticoin eflcoin p1eqcoin incoirscrancoin singbramcoin stanchiesends.jscoin hungercoin shelpcoin gativecoin bamcoin beicoin golcoin 21:05:37 XD 21:05:57 pikhqoin 21:06:57 -!- Sellyme has quit (Excess Flood). 21:08:01 -!- Sellyme has joined. 21:14:02 -!- MoALTz has quit (Ping timeout: 264 seconds). 21:44:46 -!- Phantom_Hoover has joined. 21:45:09 ah! everycoin and anycoin, those complement each other 21:45:30 hungercoin sounds funny 21:45:39 yeah, hungercoin is probably some charity thing 21:45:49 gativecoin is nice 21:46:56 -!- Phantom__Hoover has quit (Ping timeout: 245 seconds). 21:46:57 `coins 21:46:59 jugarcoin limismetalcoin encecoin sudstrudecoin comcoin strcoin cpticoin fryincoin sqaalcoin finiscrispcoin codpignycoin stepmancoin sigcoin homerlicoin villcoin bffordcoin wakcoin poordcoin bowshogicoin graydorcoin 21:47:20 how does this even produce that names? 21:47:37 `cat bin/coins 21:47:38 words --eng-1M --esolangs ${1-20} | sed -re 's/( |$)/coin\1/g' 21:51:40 increasingly annoyed at the people who show up in ##crypto to plug altcoins and associated scams 21:52:24 Slereah__: ok I think I understand what a scalar vs. vector field is, but how does it relate to spin? 21:55:33 poordcoin sounds nice 21:56:06 `coins --esperanto 21:56:07 Unknown option: esperanto 21:56:45 `coins --finnish 21:56:47 smailcoin 21:56:47 Slereah__: i'm talking with douglass_ about spin and she agrees that "What The Fuck Is Spin?" would be a good book 21:57:22 `coins --german-medical 5 21:57:24 okincoin jugcoin limpeffektivemmundcoin mancoin brascoin 21:57:55 `coins --finnish 10 21:57:56 longcoin ulkemastelectacoin paiseporuvcoin suvrejutetecoin excelatlacoin oovemcoin sharjcoin worbcoin kostepcoin raincoin 21:58:15 longcoin is long 22:04:39 Slereah__: ok I think I understand what a scalar vs. vector field is, but how does it relate to spin? < If you use Noether's theorem 22:04:48 which relates symmetries with conserved quantities 22:04:52 And use the rotation symmetry 22:05:02 You will find out that there's always two terms 22:05:11 There's the angular momentum 22:05:16 And then there's the spin density 22:05:22 (Or just spin, in quantum mechanics) 22:05:54 That quantity depends on the representation of the field$ 22:06:50 Because the rotation group acts differently depending on what kind of field you have 22:07:01 is it open season for physics questions 22:07:33 And you can find that phenomenon even in classical physics 22:07:53 For instance, the total angular momentum of light will depend on its polarization 22:08:02 Which is equivalent to the state of the spin in QM 22:08:46 kmc: did you see darkcoin, which uses eleven hash algorithms for security 22:09:12 kmc: #opencl has a shitload of mining people which is especially silly given it's not economical outside of asics, depressing :/ 22:09:35 Bike: bitcoin mining isn't, but maybe they're mining scrypt coins or others? 22:09:46 sometimes 22:09:50 also did you see http://www.h11e.com/ 22:10:07 Slereah__: ok 22:10:16 i gotta get writing my science code so i can feel opencl ain't pointless 22:10:34 "good reason for development" 22:11:16 imo write a WebGL litecoin miner and out-do http://tidbit.co.in/ (hopefully without the "getting subpoenaed" part) 22:11:36 Slereah__: how do dihydrogen cations involve lambert w 22:13:00 I don't have a clue! 22:13:06 I don't do chemistry 22:13:21 it's quantum chemistry! schrodinger equation and shit! 22:14:11 Still chemistryyyy 22:14:44 "The first successful quantum mechanical treatment of H2+ was published by the Danish physicist Øyvind Burrau in 1927," 22:14:50 physicist!! 22:15:57 http://www.smbc-comics.com/index.php?db=comics&id=2272#comic 22:16:20 only one electron though. 22:20:42 -!- augur has quit (Remote host closed the connection). 22:24:56 -!- tertu has quit (Disconnected by services). 22:24:56 -!- ter2 has joined. 22:34:00 Bike: H2+? Is that just a proton? 22:34:11 two protons and an electron. 22:34:48 Ah 22:34:56 That makes sense 22:35:10 So would a proton be H+2 or H++? 22:35:16 Actually, no 22:35:19 Only one positive charge 22:35:20 H+ 22:35:20 So H+ 22:35:37 And alpha would be He+2? 22:35:43 Alpha? 22:35:44 Or He++? 22:35:50 As in, helium-4 nucleus 22:35:57 Alpha particle 22:36:15 https://www.youtube.com/watch?v=iUW00Y5x1tM&feature=kp 22:36:21 i don't think that's an ion, so it'd just be 4He 22:36:29 Bike: It is, no electrons 22:36:40 Don't tell me you've never heard of alpha radiation =P 22:36:46 4He2+ then. 22:36:56 god this looks shitty without superscripting 22:37:03 ⁴He²⁺ 22:37:19 Ah, I see 22:37:49 That's why I was confused about H2+ 22:38:03 ^foo bar _baz ^bak means a molecule with total charge bak, made of baz bar-foo atoms 22:38:22 Since it's not clear the 2 is meant to be paired with the H and not the +, although it doesn't make sense to have 2+ charge unless there is a positron or something 22:38:53 if you're dealing with positrons you're not doing normal chemistry, which is probably for the best 22:39:33 Unless you're dealing with the chemistry of beta plus decay 22:39:42 Although the positron itself won't be significant 22:39:43 nukes? pffha 22:45:09 -!- augur has joined. 22:48:18 -!- oerjan has joined. 22:53:26 ^show rev 22:53:26 >,[>,]<[.<] 22:53:41 -!- Phantom__Hoover has joined. 22:53:53 (spoiler: >,[>,]<[.<]) <-- OKAY 22:54:15 I invented it independently! 22:54:20 can it be done any shorter? 22:54:23 IF YOU SAY SO 22:54:27 you could do ,[>,]<[.<] if not for the left underflow 22:54:29 (i guess i believe you) 22:54:41 ,[>,][<[.<]] 22:54:56 that's longer though :< 22:54:58 oh 22:55:00