IRC log for #rosettacode, 2015-01-14

All times shown according to UTC.

Time Nick Message
00:10 davido_ joined #rosettacode
00:17 Hypftier joined #rosettacode
00:29 bb010g joined #rosettacode
01:01 bullines joined #rosettacode
02:50 bullines joined #rosettacode
02:52 doppo joined #rosettacode
03:49 doppo joined #rosettacode
03:55 bb010g joined #rosettacode
04:13 ttmrichter joined #rosettacode
04:39 bullines joined #rosettacode
05:42 mwn3d joined #rosettacode
06:28 bullines joined #rosettacode
08:17 bullines joined #rosettacode
09:53 grondilu joined #rosettacode
09:55 grondilu left #rosettacode
10:05 bullines joined #rosettacode
10:42 bullines joined #rosettacode
12:31 bearophile joined #rosettacode
12:32 bearophile Hello, I have added a new task: http://rosettacode.org/wik​i/Dice_game_probabilities
12:32 fedaykin "Dice game probabilities - Rosetta Code" http://rldn.net/ATsV
12:32 bearophile See you later.
12:42 bullines joined #rosettacode
12:46 mwn3d1 joined #rosettacode
14:31 bullines joined #rosettacode
15:04 davido_ joined #rosettacode
15:38 derkirche odd programming question: is there any way (barring massive AI) to take a number and figure out what math it would take to transform it to another number?
15:39 derkirche like, for f(N) = 5; for any number N find which f results in 5
15:43 mwn3d1 derkirche: the language prolog should be able to do stuff like that
15:44 mwn3d1 You give it rules and then make a "query". The language then finds answers based on the rules you gave it.
15:45 derkirche interesting, thanks -- I look into it
15:45 mwn3d1 It takes some practice to wrap your head around the language though. We have lots of examples on the site.
15:46 opticron if you're modeling f() and not just writing it in native code (or sometimes even if you're writing it in native code), there will sometimes be facilities to check and perform inversion on the function
15:47 opticron I think matlab is capable of that in some cases
15:47 derkirche yeah -- it looks a little... uh "terse"
15:48 derkirche well, actually, my example is all I want my program to do, for f(N) = 5, find a bunch of different f's
15:50 ttmrichter derkirche: What would be the source of the f/1 that resolves to 5?
15:50 ttmrichter Because there is literally an infinite number of f/1s that would do it.
15:50 mwn3d1 Oh I had it backwards. Prolog would be really good to figure out for one f which N's result in f(N) = 5.
15:51 mwn3d1 Maybe you could rework one of the 24 game players
15:52 mwn3d1 [[24 game Player]]
15:52 fedaykin http://rosettacode.org/wiki/24_game_Player
15:52 derkirche yeah, I know there's infinite possibilities from infinite possible inputs, and even for one input ...
15:54 derkirche that looks like a good starting point, thanks!
15:57 derkirche looks like R would be the easiest to "rewrite" just change the goal variable to 5; maybe beef up the ops (somehow)
15:59 derkirche the SWI-prolog version looks good too ---- thanks!
16:11 derkirche hrm... I keep seeing JavaScript functions with "WScript.Echo" ... which is VBscript
16:15 TimToady er...the constant function 5 works really well for turning any N into 5
16:16 derkirche omg --- this is what I get for never getting past Algebra
16:17 derkirche (it was boring, and all the tests they just wanted you to regurgitate memorized formulas, and I suck at tests and rote memorization)
16:17 derkirche I went to 3 different schools, all taught Algebra the same way
16:20 bullines joined #rosettacode
16:22 derkirche I understood it, I just couldn't pass the damned tests :(
16:33 ttmrichter TimToady: +1
16:34 ttmrichter f(N) = 5
16:34 ttmrichter There's your function.
16:34 ttmrichter :D
16:36 ttmrichter In SML: fun f(N) = 5;
16:36 ttmrichter In Prolog: f(_N, 5).
17:15 derkirche nice
18:08 bullines joined #rosettacode
19:57 bullines joined #rosettacode
21:17 bb010g joined #rosettacode
21:46 bullines joined #rosettacode
22:37 bullines joined #rosettacode
22:59 mwn3d joined #rosettacode
23:10 mwn3d1 joined #rosettacode
23:31 mwn3d joined #rosettacode
23:54 mwn3d1 joined #rosettacode