In mathematics, the factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to n.

This has been the longest I’ve gone without posting a new story. For the past 10 days I’ve been working on (and off) my portfolio and when I look back on previous work I get into a pensive mood. And when I think I don’t feel. And when I don’t feel I don’t write.

I simply hate going over the past. While many people sing the values of self-critique, for me it’s useless. By default every project I’ve done in the past is bad, or at the very least not good enough. And I recognize the shortcomings of each the instant it’s done. And while that may be a healthy attitude to have towards one’s own work (it keeps one motivated and challenged) it just makes me want to burn it all (or, in the case of my digital work, Secure Empty Trash it all with random zeros and ones.)

If today I’m the product of the Meedos I was yesterday, the day before, and the day before that all the way back to the instant I was conceived, then I don’t need those other iterations of myself. They can all disintegrate. All I want is the me in the now.

{ 11 comments… read them below or add one }

“All I want is the me in the now” – MT

I love this!!!!!! :)

<3

Hahaha. Which one? There’s several MTs!

No body else but you my MT :*

“All I want is the me in the now” – MT

I love this!!!!!! :)

<3

Hahaha. Which one? There’s several MTs!

No body else but you my MT :*

Meedo I like that you have come to appriciate THE POWER OF NOW, what did i tell you ;-)

True… Though actually I haven’t read the book you recommended. :)

Meedo I like that you have come to appriciate THE POWER OF NOW, what did i tell you ;-)

True… Though actually I haven’t read the book you recommended. :)

Hmm, how do I format this nilecy?ShelloptionPrice t s0 k r sigma n = f 0 0 where fs = [[f i j | j <- [-i..i] ] | i <- [0..n] ] f i j = if i == n then max ((s i j) – k) 0 else max ((s i j) – k) (exp(-r*dt) * (p * (fs!!(i+1)!!(i+j+2)) + (1-p) * (fs!!(i+1)!!(i+j)))) s i j = s0 * u**(fromIntegral j) u = exp(sigma * sqrt dt) d = 1 / u dt = t / (fromIntegral n) p = (exp(r*dt)-d) / (u-d)123456789101112optionPrice t s0 k r sigma n = f 0 0 where fs = [[f i j | j <- [-i..i] ] | i <- [0..n] ] f i j = if i == n then max ((s i j) – k) 0 else max ((s i j) – k) (exp(-r*dt) * (p * (fs!!(i+1)!!(i+j+2)) + (1-p) * (fs!!(i+1)!!(i+j)))) s i j = s0 * u**(fromIntegral j) u = exp(sigma * sqrt dt) d = 1 / u dt = t / (fromIntegral n) p = (exp(r*dt)-d) / (u-d)Here I'm creating a list of lists, fs, indexed by i then j, of values of (f i j), then using that list within f itself. Since Haskell is lazy, this doesn't compute anything until you actually use it, then with how the lists are used it only computes it once for each pair of i and j. I also had to add (i+1) to the places where I'm using j to access the list to avoid an issue with negative indices.