00:01:15 -!- nooga has joined. 00:01:18 http://3537.pl/programista.html 00:01:20 funny 00:07:57 -!- oerjan has joined. 00:08:09 it's a job offer 00:09:27 you have to read a sequence of memory states and output the shortest boolfuck program that transforms memory from one state to another 00:27:21 SG-1 > Thing due in a week 00:27:32 That I would have had a month to work on if my computer was working 00:30:08 -!- SgeoN1 has joined. 00:30:41 Alise, ping me before you leave 00:52:50 -!- Portponky has quit (Quit: chicken is nature's potato). 01:10:25 Hmm, I think not having a commercial break here would make the episode worse. 01:13:02 worse is better? 01:13:52 just out of curiosity, any ideas? 01:14:29 a pyramid made out of giant fries 01:15:03 (going with the potato theme here) 01:15:37 sounds yummy 01:15:56 but the boolfuck delta between two memory states sounds more interesting 01:16:20 If less delicious. 01:25:56 -!- alise has quit (Ping timeout: 252 seconds). 01:28:21 still, this problem sounds interesting 01:33:02 Isn't the general problem of taking two memory states and outputting shortest program to transform them from first to second RE-hard? 01:36:06 well starting from an empty state gives you kolmogorov complexity, which is undecidable 01:36:38 -!- uorygl has quit (Read error: Connection reset by peer). 01:36:55 -!- uorygl has joined. 01:36:58 -!- uorygl has quit (Read error: Connection reset by peer). 01:41:56 -!- uorygl has joined. 01:41:57 it's not two memory states to be exact 01:42:43 http://3537.pl/programista.html check out the 'przykÅ‚ad' section, there is a sample input and output 01:44:51 um boolfuck has no I/O, so i would assume the input is the initial memory state, and the output is the final one, with some simple encoding. 01:45:17 yes 01:45:24 and that's enough to make it undecidable in general (in fact the input is unnecessary) 01:45:46 s/memory/tape/g 01:45:53 you get a sequence of memory states 01:46:01 huh? 01:46:01 Halting problem. 01:46:21 and you have to find a program that produces them during it's execution 01:46:48 like for 01:47:06 000,100,110,111 the program is +> 01:47:12 s/nooga> yes/nooga> no/ 01:47:32 um 01:47:45 if you'd only the firs and the last state 01:47:49 take* 01:48:15 i thought bf.in and bf.out were I/O for the boolfuck program, sheesh 01:49:40 nah, your task is to generate boolfuck program for given input 01:49:49 ok. it's still undecidable in principle since it's undecidable between any pair of consecutive states. 01:50:09 but obviously if the programs are very short, you can solve it 01:50:15 -!- alise has joined. 01:50:36 yo 01:50:53 http://3537.pl/programista.html 01:50:57 eset -- they make NOD32, yeah? 01:51:14 and their job offer involves boolfuck? 01:51:18 sounds like a pretty good place to work 01:51:57 oh hm wait 01:52:22 nooga: the tape length is fixed in advance? then it's solvable. 01:53:39 since then so is the halting problem 01:54:46 nooga: i say go for the job :P 01:54:51 -!- Zuu has quit (Ping timeout: 276 seconds). 01:54:54 assuming there's nothing non-obvious written in that polish 02:01:48 -!- Zuu has joined. 02:01:49 -!- Zuu has quit (Changing host). 02:01:49 -!- Zuu has joined. 02:04:51 "--and also, whomsoever solves this problem hereby enlists their soul towards our demonic army of gnomes, who do verily check every file. You thought that was a program? Ha ha ha ha ha ha..." 02:19:07 -!- nooga has quit (Ping timeout: 258 seconds). 02:36:26 hey guys I proved P=NP 02:37:09 { i = 0; for (sol in possible_solutions) { if correct(sol) return sol; if (i > 10^(10^100)) halt; } } 02:37:17 (note: algorithm is unusable) 02:37:25 (note: algorithm does always terminate because the universe will be dead by then) 02:38:56 i spot a bug 02:41:39 -!- oerjan has quit (Remote host closed the connection). 02:41:46 -!- oerjan has joined. 02:41:48 --but nobody will ever know it, ha ha ha 02:41:52 no! he's back! 02:41:54 eliminate him! 02:42:09 strange network error just as i was typing my comment :( 02:42:19 what's the bug then smarty :P 02:42:33 i is never incremented 02:42:44 um that's a feature of the language 02:42:49 { i = 0; for (sol in possible_solutions) { if correct(sol) return sol; if (i > 10^(10^100)) halt; i++ } } 02:42:53 amended version for those who don't understand. 02:42:57 >_> 02:43:01 YOU DON'T SAY 02:43:14 as i was saying but got cut off 02:43:16 : 02:43:28 . 02:43:29 there's an algorithm guaranteed to work _if_ P=NP 02:43:47 what's it called? 02:43:48 just iterate through all possible P algorithms 02:43:52 heh 02:43:59 i don't know any name 02:44:04 and besides, P=NP is practically worthless -- people who think it isn't are stupid :) 02:44:15 Since you can always have an O(n) algorithm with a really fucking huge constant. 02:44:19 oerjan: Is the set of possible P algorithms finite? 02:44:33 and dynamic programming + heuristics make NP problems okay in practice 02:44:37 pikhq: No, does that matter? 02:44:41 Oh, wait, doesn't matter. 02:44:46 The naturals are infinite, but looping through them until you find a certain one will always halt. 02:44:49 pikhq: no, but... oh wait 02:44:58 You *will* eventually find something, yes. 02:45:04 As the set is most certainly countable. 02:45:31 hm maybe i remember it wrong, it seems to have an issue if the answer is "no" 02:45:41 btw I hypothesised about a halting-checker; 02:45:47 you can do things such as: 02:45:52 Even O(n^6) algo gets inpractical fast (just look at state-of-the-art AKS-based primality tests). 02:46:04 check statements of the form "forall x in naturals, P(x)" and "exists x in naturals s.t. P(x)" 02:46:14 -!- Gregor has quit (Ping timeout: 252 seconds). 02:46:18 and also evaluate all convergent infinite sums (without analytic/symbolic methods) 02:46:23 but you cannot do the same for the reals 02:46:30 There are (countably) inifinite number of problems in P. 02:46:34 I tried recursively nesting halt-checker calls, but you can't do it 02:46:38 as far as i know 02:47:29 "Peter Shor points out that if we’re living in a simulation, then the incompatibility of quantum mechanics with general relativity might simply be a bug, in which case the universe will crash when the first black hole evaporates." 02:47:32 AIEEEEEEEEEEEEEEEEE 02:48:04 nah the black holes are page faults 02:49:24 Or then, GR is wrong (at least when describing such extreme things as black holes...) 02:49:50 Ilari: well he said "might" 02:50:06 maybe string theory exposes the internal object representation of particles :-) 02:50:10 oerjan: Seems to me that page faults being noticable is a bug. 02:50:37 you don't say 02:50:58 Ilari: Even O(1) can absolutely suck if that constant factor is long. 02:52:31 Hm, alise is still here 02:53:45 yeah. i'm being hideously irresponsible 02:54:04 I'm just impressed you slept last night. 02:56:51 Me too actually. 02:57:48 pikhq: http://nautilus.cs.miyazaki-u.ac.jp/~skata/MagicHaskeller.html 02:57:53 -- The following will find the recursive form definition of the fibonacci function from its closed-form solution. 02:57:53 init075 -- The problem is tough, so you should be prepared to resort whatever measure you can take! 02:57:53 printAny (¥f -> all (¥n -> (f :: Int->Int) n == let phi = (1 + sqrt 5)/2 in round ((phi^n - (1-phi)^n) / sqrt 5) ) [0..9]) 02:57:55 Nuff said. 02:58:09 (Note of course that the Japanese yen sign is, in all the Windows fuckup glory, being used as a backslash.) 02:58:13 (Just like in file paths.) 02:58:50 To be perfectly fair to Windows, that's actually a fuckup from the JIS that old version of Windows merely complied with. 02:58:57 Versions, even. 02:59:53 But yeah, pikhq, this thing generates the recursive haskell fibonacci from Binet's formula. 03:00:04 Admittedly it isn't looking at Binet's formula -- pre-computed instead -- but still! 03:00:17 Hmm. Spiffy. 03:00:24 JIS? 03:00:48 Japanese Industrial Standard. 03:01:56 -!- Gregor-L has joined. 03:03:58 Japanese Industrial Shitpile 03:04:42 The JIS standards are a shitpile. 03:07:07 My point exactly. 03:16:14 I'm bored, and I'm going to bed soon. But I'm still bored. 03:17:15 -!- augur has quit (Remote host closed the connection). 03:17:28 -!- augur has joined. 03:17:45 $ wargames 03:17:45 Would you like to play a game? [anything] 03:17:45 A strange game. 03:17:45 The only winning move is 03:17:45 not to play. 03:17:47 Pfft. 03:17:55 It needs to include a full simulation of Global Thermonuclear War and Tic-Tac-Toe. 03:18:37 thermonuclear tic-tac-toe? 03:18:41 Or that 03:19:00 -!- ws has quit (Quit: ...). 03:20:27 Wow. 03:20:36 I've discovered a brilliant hangman strategy. 03:20:45 Just start "etaoinshrdlu". 03:20:54 augur: i see great potential there 03:21:14 what 03:21:24 [[Twenty masked gunmen in Gaza attack and burn to the ground a summer camp for children run by UNRWA for "teaching schoolgirls fitness, dancing, and immorality."]] 03:22:48 lol 03:25:19 oh wait 03:25:22 i thought it said "immortality" 03:25:28 :D 03:26:25 lol 03:26:53 -!- Gregor-L has changed nick to Gregor. 03:26:54 If only they could teach immortality. 03:27:09 Hellote again sir. 03:28:18 i thought it was some awesome religious crazies 03:28:27 THEY TEACH IMMORTALITY!!! THIS IS UNHOLY!! 03:28:45 ehird@ehird-desktop:/usr/games$ ./arithmetic 03:28:45 9 - 2 = 7 03:28:46 Right! 03:28:46 6 + 8 = Wow, fuck this. 03:28:46 Please type a number. 03:28:53 Some BSD games really suck. 03:29:35 Hah. 03:29:42 a better game would be /usr/games/ImpossibleMathProblems 03:29:57 $ phd 03:30:06 Do all of the zeroes of the Riemann zeta function lie on the critical line? 03:30:06 /usr/games/Level5ProblemsFromTheArtOfComputerProgramming 03:30:20 Can the problems in NP be solved by a P algorithm? 03:30:20 problem one: prove that for all n > 2 and all x, y, z in N, x^n + y^n != z^n 03:30:29 Do all Collatz sequences eventually reach 1? 03:30:35 augur: That's no longer level 5. 03:30:39 augur: that's already been proven. 03:30:42 4.5, IIRC. 03:30:50 yes, but its still pretty hard :P 03:30:57 ok scratch that 03:30:58 Yes, but it's not level 5! 03:31:05 construct an ELEGANt proof of that. 03:31:11 What are the level 5 problems then? 03:31:14 augur: Wiles' proof is elegant. 03:31:30 alise: Problems with unknown solutions, IIRC. 03:31:36 im not sure that mathematicians agree. 03:31:59 More elegant than everything else we've got. 03:32:11 Except for that one the margin is too small to contain. 03:32:44 augur: I'm relatively sure you're wrong. 03:32:58 "Such-and-such's proof of X is ugly because it's complicated" is basically what laymen think. 03:33:03 his proof certainly isnt marginalia, thats for sure 03:33:12 Yes - that's because Fermat was full of shit. 03:33:33 The problem is Hard. The countless numbers of false solutions and the fact that only advanced mathematics solved it show with extremely high probability that Fermat was simply wrong about having a proof. 03:34:26 What was length of the proof? 350 pages or so? That can't be elegant. 03:34:37 Pity he didn't have a larger margin. 03:34:44 The Wiles paper is over 100 pages long and often uses the peculiar symbols and notations of group theory, algebraic geometry, commutative algebra, and Galois theory. 03:34:46 Over 100 pages isn't too bad. 03:34:57 Remember that it turns out that Fermat's Last Theorem is pretty damn advanced stuff! 03:35:07 Not everything can have a trivial proof. That doesn't mean the complicated proofs aren't elegant. 03:36:21 http://math.stanford.edu/~lekheng/flt/wiles.pdf ;; the proof as it was published in Annals of Mathematics 03:36:27 Reminds of excercise problem of proving that every undirected graph can be converted to directed graph such that on every vertex, indegree and outdegree only differ by at most 1... 03:36:33 http://users.tpg.com.au/nanahcub/flt.pdf ;; one with searchable text (much smaller; hundreds of kilobytes instead of 10mb) 03:37:35 Of course, I don't understand it; I doubt many people do. 03:37:36 There's at least elegant way of proving that and unelegant way. 03:37:41 But I don't look at it and see an ugly thing. 03:37:49 I see a very complicated, complex thing, but not a gnarly thing. 03:39:15 Besides, that article isn't even a proof of FLT. 03:39:37 It's a proof of an entirely different theorem; FLT just so happens to follow from it and countless other lemmas posed before. 03:39:43 Elegant proofs tend to take huge leaps that are simple, yet unobivious. 03:39:54 The actual proof of FLT would just be... "Q.E.D." 03:41:10 Like leaping from that direction problem to eulerian circuits. 03:41:27 http://www.x11r5.com/ 03:42:02 * comex recently read a semishitty science fiction book about FLT 03:42:21 what on earth is x11r5.com :) 03:42:27 a markov bot 03:42:38 Why's it have that name? 03:42:48 fungot: you're more coherent than x11r5. 03:42:48 alise: is the language/ library dichotomy, i know; it's an occupational hazard for all of them 03:42:54 ^style 03:42:54 Available: agora alice c64 ct darwin discworld europarl ff7 fisher ic irc* jargon lovecraft nethack pa speeches ss wp youtube 03:42:58 fungot: Wax eloquent. 03:42:59 alise: my network outage took a lot of native ppc code compilers for scheme or any other swear wordswear. what more could one ask for? i'm trying to 03:43:05 Because it uses the X11 server to .. do something 03:43:10 fungot: X11. 03:43:11 alise: which would mean no integer arrays larger than 64k bytes, or truncate the key? evil grin which would have told me, what?" 03:43:15 I'm not creative enough to come up with a good joke 03:43:57 It runs some code in an xterm, takes a screenshot, and uploads it 03:44:29 ^style agora 03:44:29 Selected style: agora (a large selection of Agora rules, both current and historical) 03:44:39 fungot: prove Fermat's Last Theorem 03:44:39 comex: ( i) satisfy the draw within a time limit, e ceases to hold the delegated player; 03:45:28 alise: ahh but what if fermat's proof was real :o 03:45:59 ^style nethack 03:45:59 Selected style: nethack (NetHack 3.4.3 data.base, rumors.tru, rumors.fal) 03:46:06 augur: it isn't 03:46:06 fungot: prove Fermat's Last Theorem 03:46:06 comex: if you try to zap it!" but the sword. 03:46:14 ^style darwin 03:46:14 Selected style: darwin (Books by Charles Darwin -- you know, that evilution guy) 03:46:20 fungot: prove Fermat's Last Theorem 03:46:20 fungot: i bet darwin could prove FLT with smilies 03:46:21 alise: oh pshaw you dont know 03:46:21 comex: my chief object is to see a flora written by a man who intends keeping pointers naturally tries to get/ subject as clear as daylight. old flourens " ( examen du livre de m. darwin une critique dont je fnord trouve que des debris dans un journal fnord.,/ outer edge :)/ reef. 03:46:22 alise: origin :) species,' and arranged for/ publication :) one volume for 1867-8.) i particularly admired tyndall's little speech " professor tyndall was president :)/ royal society, with notes on. 03:46:33 On / Origin :) Species 03:46:36 he speaks french! 03:46:54 wait, fnord? 03:47:04 words deemed too rare to place in the file 03:47:05 what exactly is the source of that :p 03:47:07 :) and / are encoding errors 03:47:17 ^style alice 03:47:18 Selected style: alice (Books by Lewis Carroll) 03:47:20 fungot: Oh, my! 03:47:20 alise: ' i'm not a bird!' and the waiters set a leg of mutton, and began fnord them into colours. 03:47:23 ^style youtube 03:47:23 Selected style: youtube (Some YouTube comments) 03:47:28 -!- coppro has quit (Quit: I am leaving. You are about to explode.). 03:47:36 fungot: I would not have thought of using YouTube comments. 03:47:37 comex: 15 seconds. what the hell 03:47:47 fungot: WHAT 03:47:47 alise: why internet is like wtf 03:47:49 fungot: took you less than that to respond, eh? 03:47:49 comex: whatever, i've told you where: they do their homework. seriously folks, do your own) so it wont have the same 03:47:51 hahaha 03:47:55 `addquote alise: why internet is like wtf 03:47:55 alise: avril roxs your soxs video 03:47:55 fungot: :( 03:47:55 comex: well, and the aircraft had no passengers... that guy is fantastic. there were probably 3 people died 03:48:06 this is the best source. 03:48:08 163| alise: why internet is like wtf 03:48:18 comex: it's quite a bit verbatim iirc 03:48:29 fungot: the aircraft? where? 03:48:29 comex: you obviously can't be bothered to read the description! it's kinda scary at first but it was landing at a low approach of a bitch. 03:48:31 asiekierka assembled it by manually copying/pasting youtube comments (he isn't a good enough programmer to write a scraper) 03:52:19 hmm... did anyone mention how scarily close this game is to a Turing machine: http://jayisgames.com/games/manufactoria/ 03:52:36 It is a turing machine, or at least TC. 03:52:37 Has unbounded memory 03:52:41 *memory. 03:53:21 yeah, but it's a queue instead of a tape 03:53:37 Not long til I have to be up in 5 hours. 03:54:06 sleep is totally for wimps :p 03:55:49 I must admit that I sometimes indulge, however 03:59:51 fuck 03:59:52 fuck 03:59:53 must sleep 04:02:19 -!- pikhq_ has joined. 04:02:35 MUST SLEPOFK 04:04:08 -!- Mathnerd314 has quit (Ping timeout: 240 seconds). 04:04:32 -!- pikhq has quit (Ping timeout: 276 seconds). 04:07:10 bye 04:07:13 Sgeo__: ping 04:07:17 it's time 04:07:29 alise, bye :( 04:07:34 Sgeo__: bye :) 04:07:35 bye alise 04:07:36 alise, keep working on improving things 04:07:37 `style irc 04:07:38 No output. 04:07:40 ^style irc 04:07:40 Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams) 04:07:48 oerjan: HEY i didn't ask YOU 04:07:49 sheesh! 04:07:53 and i leave unsatisfied! 04:07:55 -!- pikhq_ has changed nick to pikhq. 04:07:59 -!- alise has quit (Quit: Leaving). 04:07:59 NEENER NEENER 04:15:31 man 04:15:35 you know what i need? 04:15:37 alcohol 04:15:37 :D 04:18:49 -!- lifthrasiir has quit (Ping timeout: 245 seconds). 04:32:06 -!- Oranjer has left (?). 05:01:59 -!- elliottcable has changed nick to ec. 05:02:47 -!- ec has changed nick to \aaa. 05:02:57 -!- \aaa has changed nick to \\-\\. 05:03:45 -!- \\-\\ has changed nick to ec. 05:06:42 -!- Oranjer has joined. 05:43:26 -!- coppro has joined. 06:14:21 -!- oerjan has quit (Quit: Good night). 06:18:28 -!- Oranjer has left (?). 06:32:43 -!- FireFly has joined. 06:32:50 -!- Gregor has quit (Ping timeout: 252 seconds). 06:38:12 NEENER NEENER 06:38:25 -!- Gregor has joined. 06:44:33 -!- ec has changed nick to metapointer. 06:57:02 -!- Gregor has quit (Ping timeout: 252 seconds). 06:58:54 -!- lifthrasiir has joined. 06:59:28 -!- Gregor has joined. 07:01:36 -!- tombom has joined. 07:01:56 -!- metapointer has changed nick to ec. 07:08:49 -!- lifthrasiir has quit (Ping timeout: 245 seconds). 07:09:27 -!- kar8nga has joined. 07:34:53 -!- lifthrasiir has joined. 07:49:00 -!- FireFly has quit (Quit: swatted to death). 07:51:51 -!- tombom has quit (Quit: Leaving). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 09:16:15 -!- gm|lap has joined. 10:06:58 -!- Gracenotes has quit (Remote host closed the connection). 10:16:00 -!- Gracenotes has joined. 11:11:49 -!- sebbu2 has changed nick to sebbu. 11:23:39 -!- Gracenotes has quit (Read error: Connection reset by peer). 11:29:42 -!- sdorand has joined. 11:52:00 -!- gm|lap has quit (Quit: ilua). 11:58:55 -!- kar8nga has quit (Remote host closed the connection). 12:07:36 -!- ws has joined. 12:12:48 -!- coppro has quit (Ping timeout: 265 seconds). 12:24:52 -!- MizardX has joined. 12:25:42 -!- Gracenotes has joined. 12:44:43 -!- Mathnerd314 has joined. 13:01:00 -!- FireFly has joined. 13:07:54 -!- Sgeo__ has quit (Ping timeout: 265 seconds). 13:08:11 -!- kar8nga has joined. 13:08:35 -!- Sgeo__ has joined. 13:14:51 -!- Phantom has joined. 13:15:13 -!- Phantom has changed nick to Guest12499. 13:16:13 -!- Guest12499 has changed nick to Phantom_Hoover. 13:16:38 -!- FireFly has quit (*.net *.split). 13:16:38 -!- lifthrasiir has quit (*.net *.split). 13:16:38 -!- jcp has quit (*.net *.split). 13:16:38 -!- Quadrescence has quit (*.net *.split). 13:16:39 -!- ec has quit (*.net *.split). 13:18:37 -!- FireFly has joined. 13:18:37 -!- lifthrasiir has joined. 13:18:37 -!- jcp has joined. 13:18:37 -!- Quadrescence has joined. 13:18:37 -!- ec has joined. 13:42:09 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 13:54:41 -!- MigoMipo has joined. 14:06:03 -!- sebbu2 has joined. 14:07:14 -!- kar8nga has quit (Remote host closed the connection). 14:09:02 -!- sebbu has quit (Ping timeout: 260 seconds). 14:09:02 -!- sebbu2 has changed nick to sebbu. 14:35:47 -!- ws has quit (Quit: take a nap). 15:05:26 -!- Gregor has quit (Ping timeout: 252 seconds). 15:07:09 -!- augur has quit (Ping timeout: 245 seconds). 15:07:21 -!- Phantom has joined. 15:07:49 -!- Phantom has changed nick to Guest93365. 15:08:53 -!- Guest93365 has quit (Client Quit). 15:25:26 -!- sdorand_ has joined. 15:28:04 -!- sdorand has quit (Ping timeout: 265 seconds). 15:34:22 -!- Gregor-L has joined. 15:41:20 -!- Slereah has quit (Ping timeout: 276 seconds). 15:45:32 -!- Slereah has joined. 15:53:02 -!- Slereah has quit (Ping timeout: 276 seconds). 15:53:18 -!- Gregor-L has changed nick to Gregor. 15:56:51 -!- cheater2 has quit (Ping timeout: 260 seconds). 15:56:51 -!- cheater3 has joined. 16:01:45 -!- Slereah has joined. 16:04:48 -!- oerjan has joined. 16:06:31 -!- BeholdMyGlory has joined. 16:29:02 -!- cheater3 has quit (Ping timeout: 260 seconds). 16:33:00 -!- Zuu has quit (Ping timeout: 276 seconds). 16:33:22 -!- cheater2 has joined. 16:37:48 -!- Zuu has joined. 16:37:49 -!- Zuu has quit (Changing host). 16:37:49 -!- Zuu has joined. 16:46:31 -!- aschueler has joined. 16:51:48 -!- Phantom_Hoover has joined. 16:52:26 * Phantom_Hoover wants to create a Lisp dialect where every instance of "s" is replaced with "th" 16:53:16 (litht 1 2 3) 16:53:31 *cough* http://esoteric.voxelperfect.net/wiki/LITHP 16:53:47 Yay! 16:54:56 great nerds think alike 16:55:20 -!- Mathnerd314_ has joined. 16:57:03 -!- Mathnerd314 has quit (Ping timeout: 260 seconds). 16:57:38 -!- Mathnerd314_ has changed nick to Mathnerd314. 17:00:28 I see figuring out Skyroads level format has been discussed here before... 17:04:00 Skyroads? 17:05:17 Why in the name of goat did we make the wiki public domain? 17:06:06 Its a PC game... 17:06:24 We can't even put GPL stuff on! 17:07:46 -!- fizzie has quit (Ping timeout: 260 seconds). 17:07:50 No GPLed code. On a *software* wiki. 17:08:17 hm where is ais when you need him 17:09:11 Phantom_Hoover, isn't the wiki GFDL or CC-by-sa? 17:09:25 No, PD. 17:09:44 It's the page Esolang:Copyrights 17:09:49 * Zuu gives Phantom_Hoover cookies :) 17:09:57 public domain for the win 17:10:30 * Zuu has no clue what people are on about, Zuu just arrived 17:10:31 It's a nice concept, but it's utterly impractical. 17:10:44 CC-BY-SA would be much better. 17:11:07 I fact, since it's PD it could be switched with little fuss. 17:11:54 -!- oerjan has quit (Quit: Later). 17:13:25 -!- fizzie has joined. 17:14:04 * AnMaster watches a gtkwave window trying to figure out what is wrong 17:14:28 doh... 17:14:42 anyway, I still need ais, for a VHDL question 17:16:58 also fun, ghdl seems to accept Ã¥Ã¤Ã¶Ã„Ã– in comments in VHDL. But for Ã… it complains about invalid char 17:17:29 I guess UTF-8 Ã¥Ã¤Ã¶Ã„Ã– simply doesn't hit problematic byte values for whatever encoding it uses. 17:17:30 but Ã… does 17:17:43 it does 17:17:55 Ã… is capital Ã¥ 17:18:00 Zuu, I know 17:18:03 they should be in the same code tables 17:18:15 Zuu, I speak Swedish after all. And the file was saved in UTF-8 17:18:24 presumably, it doesn't use UTF-8 though 17:18:25 meaning that if one is problematic the other should be aswell 17:18:37 Zuu, well that was not the case 17:18:49 because the software is bugged 17:19:08 Zuu, well rather, the software in question use some other encoding than UTF-8 when reading the file 17:19:20 and since the editor saved the file in UTF-8 17:19:35 presumably Ã… hits a bad code point while Ã¥ does not 17:19:39 i just explained to you that even if it does, that wouldnt be the problem 17:19:53 Zuu, well I maintain that it is logically the problem 17:20:21 $ echo -n 'Ã…' | od -tx1 17:20:22 0000000 c3 85 17:20:22 $ echo -n 'Ã¥' | od -tx1 17:20:23 0000000 c3 a5 17:20:46 so assuming it treated it as some single-byte encoding... hm 17:20:51 what is ASCII 85? 17:21:04 Ã… 17:21:08 in latin1 17:21:20 huh 17:21:24 in utf its invalid 17:21:25 Zuu, and a5? 17:21:34 okay so my system is fucked up... 17:21:34 'Ã¥' in latin1 17:21:43 $ locale 17:21:43 LANG=sv_SE.UTF-8 17:21:44 wth 17:21:46 also invalid in utf 17:21:51 why would it not use that 17:23:04 Zuu, on the other hand, what is c3? 17:23:13 dunno 17:23:14 and is c3 85 valid UTF-8? 17:23:21 possibly 17:23:38 i would say yes 17:23:51 right 17:24:07 so that happens to be the multibyte codepoint of Ã¥ then in utf8 presumably 17:24:12 which makes sense 17:25:36 so... I really need ais now :/ 17:25:50 what is this ais? 17:25:56 icecream? 17:26:04 * Zuu wants icecream 17:26:18 -!- sebbu has quit (Ping timeout: 276 seconds). 17:26:46 aiscream 17:26:49 :P 17:29:16 Zuu, ais523 in here 17:29:21 he is offline atm 17:29:30 oh! 17:29:35 and I really need his knowledge about something (VHDL to be specific) 17:29:44 I see :) 17:29:50 if you happen to know VHDL? 17:30:17 Not really, i think it has something to do with a storage format for 3d material, no? 17:30:25 nop 17:30:30 it is a hardware description language 17:30:38 used to program FPGAs and such 17:30:39 that would have been my second gyess :) 17:31:17 I've read a bit about it 17:31:37 that was quick: from not having a clue to reading a bit about it ;P 17:32:01 basically I need this in a port map: foo_vector(32 downto 0) => bar_vector(0 to 32). That is reverse the vector for one component instance (but not for the other one) Which is annoying since that code does not compile. And with 32 signals in that vector, doing manual mapping per signal would be rather annoying. 17:32:09 anyone know how to do this? 17:32:14 its a matter of attaching these acronyms to stuff in my grain 17:32:21 *brain 17:32:36 knowing the name of somthing is very very different from knowing what something is about 17:33:33 * Zuu knows lots of stuff he doesnt remember the name of 17:33:57 hm true 17:34:03 there is also verilog, another HDL 17:34:14 so how do you know it wasn't that which you read something about? ;P 17:34:32 Because i read about both 17:34:37 mhm 17:34:41 and two more 17:34:50 Wikipedia 17:35:50 okay wtf at the file menu entries in gtkwave... 17:36:03 "read save file" 17:36:06 "write save file" 17:36:08 "write save file as" 17:36:20 I have absolutely no clue what the first one is 17:36:42 probably reload? 17:36:53 unless it is meant like "read (save file)", but then what the heck does "open" do 17:41:33 -!- ws has joined. 17:52:02 -!- nooga has joined. 17:54:08 how to check if ray hits pixel? the ray is given by 2d vector pair (o,d) where o is origin and d is a normalised direction adn pixel is given by 2d vector p 17:55:01 i can't figure that out since pixels' coordinates are from Z^2 and vectors are in R^2 17:55:31 -!- tombom has joined. 17:55:35 nooga, find out if pixel is in the path of the ray 17:55:42 well 17:55:46 hm 17:55:54