Perl 6 - the future is here, just unevenly distributed

IRC log for #rosettacode, 2011-11-30

| Channels | #rosettacode index | Today | | Search | Google Search | Plain-Text | summary

All times shown according to UTC.

Time Nick Message
01:19 mwn3d_phone joined #rosettacode
05:47 fedaykin joined #rosettacode
06:41 mischi joined #rosettacode
08:30 mischi joined #rosettacode
09:33 mischi joined #rosettacode
10:10 bearophile joined #rosettacode
10:11 bearophile Hello, is this a good place to suggest a new task?
10:22 mischi hm, not if there is only time of 6 minutes :-)
10:26 eMBee yeah. i saw it in time but got interrupted before i could type an answer
10:32 mischi !seen kingxerxes
10:34 eMBee not since 2476 years...
10:37 mischi ;-)
12:18 Test_ joined #rosettacode
12:20 Test3 Hello
12:24 eMBee hi
12:25 Test3 I'd like to suggest a Task
12:26 Test3 It's named "Paraffins"
12:26 Test3 Scheme implementation: http://www.ccs.neu.edu/home/w​ill/Twobit/src/paraffins.scm
12:26 fedaykin http://rldn.net/5yM
12:26 Test3 Haskell implementation: http://darcs.brianweb.net/nofi​b/imaginary/paraffins/Main.hs
12:26 fedaykin http://rldn.net/4yL
12:26 Test3 A paper that explains it: http://www.cs.wright.edu/~tkprasad/​courses/cs776/paraffins-turner.pdf
12:26 fedaykin http://rldn.net/FS4
12:27 Test3 It's used as an old small functional programming benchmark too, often in Scheme
12:30 Test3 There is a Java version too, floating
12:31 eMBee can you write a summary of the explanation? and add it to the wiki?
12:32 Test3 This program is rather simple, its purpose is to count how many different paraffin molecules there are for a given numbr of carbom atoms
12:33 Test3 The molecules must be topologically different
12:33 Test3 So no reflections, etc.
12:34 eMBee howdoes the input data look like?
12:34 Test3 The input is just how many carbon atoms you want, like 17
12:35 Test3 Then the program can output how many different differentr paraffins there are with 17 carbon atoms
12:35 Test3 Or it can even actually show them in some very simple way
12:35 eMBee ah
12:36 Test3 There is a sequence of those results too: http://oeis.org/A000602
12:36 Test3 1,1,1,2,3,5,9,18,35,75,159,355​,802,1858,4347,10359,24894,...
12:37 Test3 The index starts from 1 of course
12:37 eMBee the index is the number of atoms, right?
12:38 Test3 This means that if you have 4 carbon atoms, then you are able to build only 2 different paraffin molecules
12:38 * eMBee nods
12:38 Test3 The index is the number of carbon atoms
12:38 eMBee yes
12:38 Test3 But then there are many hydrogen atoms too
12:38 Test3 If you look at the PDF paper linked, you see some simple images too
12:39 eMBee can you describe the algorithm in a few paragraphs, or is it necessary to read the paper?
12:39 Test3 But that's the stretch goal.
12:39 Test3 It's not necessary to read the paper, reading the Haskell or Scheme code is enough :-)
12:40 Test3 The problem can be expressed in few lines of text
12:40 eMBee ok, just make a new page: http://rosettacode.org/wiki/Paraffins edit it and write a description
12:40 fedaykin "Paraffins - Rosetta Code"
12:40 Test3 But the solutions are not necessary simple. The haskell code is about 90 lines (with blank lines too)
12:41 eMBee that is fine, there are some more complex tasks on the wiki already
12:41 Test3 I know.
12:41 Test3 See you
12:42 eMBee and i don't think there are many outside the domain of math and computer science, this may be the first one for chemistry
12:42 Test3 Organic chemistry
12:42 Test3 :-)
12:42 eMBee mark it as a draft task: {{draft task|Paraffins}}
12:43 eMBee if you use the implementations already existing, make sure the copyright allows that. otherwise just provide a link to them, don't copy them
12:44 Test3 OK
12:46 mwn3d_phone1 joined #rosettacode
13:18 Sora-Kun joined #rosettacode
14:20 eel2 REPL log monitoring broke! problem: <EOFException>
16:01 _ilbot joined #rosettacode
16:01 Topic for #rosettacode is now Rosetta Code: Coding in (∞ - 1) languages ; http://irclog.perlgeek.de/rosettacode/today ; Pop a tab and stick around!
17:24 Sora-Kun joined #rosettacode
18:53 Sora-Kun joined #rosettacode
19:42 mischi joined #rosettacode
21:50 Ludicrous joined #rosettacode
21:52 Ludicrous does anyone have any ideas on how to start writing a decryption program?
21:54 mwn3d_phone Ludicrous: what are you decrypting?
21:56 Ludicrous I wrote a program that takes a message and scrambles it in lots of ways and such and I wrote a decrypter for that specific program.. i'm wondering how to write a general one
21:56 Ludicrous its all in text files
21:57 mwn3d_phone There's no real "general" decryption program
21:57 mwn3d_phone It all depends on how the data is encrypted
21:57 Ludicrous like if I were to post my output file online, and someone wanted to know what I message says, how might they go about it?
21:58 mwn3d_phone They'd have to know how to decrypt it (or have the decryption program) and use that method
22:00 Ludicrous very interesting, thank you for your input!
22:08 mwn3d_phone Ludicrous: we have a simple encryption task on our site: [[rot-13]] is it I think
22:08 fedaykin http://rosettacode.org/wiki/rot-13
22:09 mwn3d_phone It just so happens that the decryption program for that is the same as the encryption one
22:10 mwn3d_phone Though I wouldn't use that for really important stuff. Its a very old algorithm and people can probably recognize it by the look of the encrypted data
22:10 Ludicrous Thank you, I have never studied encryption, I made these programs on a whim.  I'll definately check it out.
22:13 Ludicrous My algorthim is complete different actually, mine involves a list that contains every word in the english language
22:15 mwn3d_phone Oh just a lookup table?
22:15 mwn3d_phone What happens if the word isn't on the list? Like a name or a place?
22:16 Ludicrous not exactly, the user picks how long each encrypted word will be, and looks up a word in my database that starts with the letters of the message to be hidden
22:16 Ludicrous I didn't say that clearly...
22:16 Ludicrous CAT would contain 3 random words in my database, which then in turn are changed so its not obvious
22:17 Ludicrous 1 word starting with C, 1 with A, and etc
22:17 mwn3d_phone Ohhhh
22:18 Ludicrous that is the general principle, the database doesn't even need to contain words
22:18 Ludicrous i mean legitimate words
22:18 mwn3d_phone Right
22:19 Ludicrous I thought it was pretty clever, lol
22:20 Ludicrous so even if you have the decrypter you have to know the lengths of the words used
22:20 Ludicrous basically a "password"
22:20 mwn3d_phone Oh I see
22:20 mwn3d_phone Yeah that's good
22:21 mwn3d_phone A good little note-passing method
22:22 mwn3d_phone I had something like that with one of my friends but yours is a bit more complex because it has a password
22:22 mwn3d_phone We would just shift our hands one key to the right and type
22:23 mwn3d_phone Eventually we got good enough to read it without decoding it
22:23 mwn3d_phone At least...some of it
22:23 Ludicrous Nice, not this tho!
22:23 Ludicrous I hope one of my friends will try and decode it by hand
22:23 Ludicrous It is easier for a human than a machine sometimes
22:24 Ludicrous Thanks for the chat but I gotta get going
22:24 Hypftier mwn3d_phone: I've seen search engines auto-correct that kind of typing ;) ... sometimes even with only one hand shifted
22:25 mwn3d_phone Hypftier: we were just lucky we both used the same keyboard arrangement
22:26 mwn3d_phone And it wouldn't work too well on cell phones either
22:26 mwn3d_phone I guess its just an obsolete crappy code
22:27 Hypftier well, nothing cryptographically relevant, but I guess that goes for all such codes :)
23:09 Sora-Kun hi guys :D
23:09 Sora-Kun happy to see this IRC alive
23:32 mwn3d_phone joined #rosettacode
23:32 mwn3d_phone Sora-Kun: activity comes in bursts
23:38 Sora-Kun mwn3d_phone: yea :)
23:38 Sora-Kun and good night guys :)

| Channels | #rosettacode index | Today | | Search | Google Search | Plain-Text | summary