You may also implement your solution in the afterlife, but your score will exponentially decay in accordence to the function, e^(-.000231t), where t is in seconds.
actually, lambda calculus looks like ef-ing sped mathematics ^^
Name:
Anonymous2013-02-19 4:12
can the op guarantee that the ... oh wait it probably won't work anyway.. i was going to say that the input values were in some finite range.. but yeah i don't think it's going to work..
Prove me wrong if you will =)
Name:
Anonymous2013-02-19 4:25
ffs look at this...
For example, suppose we have an expression such as
\x y -> 2*x*x + y
and we change this to
\a b -> 2*a*a + b
This is clearly the same function, even though it uses different variable names. This process of renaming variables is alpha conversion.
Note that alpha conversion is not as simple as it first seems. We must be careful to avoid name capture. For example, if we rename
x
to
y
in
\x -> x + y
then we end up with
\y -> y + y
, which is not the same function!
next
For example, suppose we apply the function
(\x -> 2*x*x + y)
to the value
7
. To calculate the result, we substitute
7
for every free occurrence of
x
, and so the application of the function
(\x -> 2*x*x + y)(7)
is reduced to the result
2*7*7 + y
This is a beta reduction.
next
An eta conversion (also written η-conversion) is adding or dropping of abstraction over a function. For example, the following two values are equivalent under η-conversion:
\x -> abs x
and
abs
Converting from the first to the second would constitute an eta reduction, and moving from the second to the first would be an eta abstraction. The term 'eta conversion' can refer to the process in either direction.
next
A lambda abstraction is another name for an anonymous function. It gets its name from the usual notation for writing it: for example, \lambda x \to x^2. (Another common, equivalent notation is: \lambda x . \ x^2.)
>>6
Equivalent points will be rewarded for a holomorphic encryption function for brainfuck.
>>9
If it makes things easier you can assume a finite bound on the complexity of the expressions, but the solution would no longer be turing complete, so it would be partial credit. If your encryption function can only encrypt a finite number of values, then you can always consider arbitrary length tuples of these values. Very long lambda strings can be partitioned into blocks and each block can be encrypted separately/sequentially/however-you-want-to-do-it. Of course there would need to be some preservation of structure in order to have an encrypted eval function, but not enough preservation to give away what it is...
>>10
Yeah, it might be easier to just work off of the turing machine model instead.
Name:
Anonymous2013-02-19 22:39
cryptography is a jewish pseudoscience where nothing is ever proven. jews use it to steal our data. :(
>>23
He meant homophonic, something to do with speaking with a LISPTH
Name:
22-232013-02-20 0:18
By the way, I'm just wondering: have you guys ever craved cock so badly that you found yourself running around outside, howling at the moon for it? Literally ROARING at the top of your lungs, wanting nothing less than a dick's head churning against your glottal stop?
Note that alpha conversion is not as simple as it first seems.
lmfao yes it is..
Name:
Anonymous2013-02-20 0:21
Haskell should be killed for being such a lazy, useless language.
Not unlike the dog.
Name:
Anonymous2013-02-20 0:29
The most complicated part is the bloody name... using a couple of greek/latin(?) letters does not make it any smarter.. in fact it's probably detracting from the miniscule credibility it has..
We need to alpha convert it's name to something else...
"Nigger, this mature is not too my mosting!"
Nigger : "Sorry sir, I didn't know you wanted to GIVE ME THE FUCKING PASSWORD.."
And then anonymous was under the canada.