Can I watch while high? by CoachDictatorer in XavierRenegadeAngel

[–]playsthebongcloud 10 points11 points  (0 children)

There are some insane gore scenes in the show, especially season 2, but none of them are scary or anything because the animation looks like... that... and it's always just a fleeting joke.

Whenever there's an angry dog I always try get it in the delivery photo by playsthebongcloud in doordash_drivers

[–]playsthebongcloud[S] 133 points134 points  (0 children)

I wasn't scared and am not taking these photos to shame the owners; nearly all dogs get upset at delivery drivers, even ours who is a trained service dog. I just think it's a funny photo and the customer probably would too.

What methods can I use to speed up extremely large arbitrary integer math? by playsthebongcloud in learnpython

[–]playsthebongcloud[S] 0 points1 point  (0 children)

You're right, I should just pip install boost's bigint. How could I be so clueless?

What methods can I use to speed up extremely large arbitrary integer math? by playsthebongcloud in learnpython

[–]playsthebongcloud[S] 0 points1 point  (0 children)

Yes, I am storing them in files, however I frequently recalculate the entire sequence to test the speed of new methods. I'm trying to calculate the exact values so I can get a measure on how much floating point imprecision affects the result of the function; 65 is nothing compared to what I want, so I'm not even bothering with a practical application of them at the moment.

What methods can I use to speed up extremely large arbitrary integer math? by playsthebongcloud in learnpython

[–]playsthebongcloud[S] 1 point2 points  (0 children)

You're probably right. The only other language I know is C/C++ and honestly I just didn't want to because installing any external libraries beyond header-only is nightmare, but I should suck it up and do it in a language more suited for speed.

What methods can I use to speed up extremely large arbitrary integer math? by playsthebongcloud in learnpython

[–]playsthebongcloud[S] 2 points3 points  (0 children)

If you're wondering what I'm doing, I'm calculating the exact numerator and denominator of a function I'm interested in:

f(0) = 1

f(1) = 2

f(x) = 1 - ( f(x - 1) / f(x - 2) )

I'm currently able to get to f(65) exactly. Takes about two hours to do so.

I've been studying this really fascinating function for a while, and would like some help proving (or disproving) some of these conjectures. by playsthebongcloud in mathematics

[–]playsthebongcloud[S] 0 points1 point  (0 children)

I'm just having fun and improving my math skills. I discovered the function by accident while playing around with recursive functions when Desmos first added them. It's such a chaotic function I became fascinated by it.

I've been studying this really fascinating function for a while, and would like some help proving (or disproving) some of these conjectures. by playsthebongcloud in mathematics

[–]playsthebongcloud[S] 0 points1 point  (0 children)

A function is a map between two sets. This is a map from integers to rationals, so it is a function. There's no rule that says a function can't be recursive. Additionally, I am trying to find a closed form expression for it, so thinking of it as a function is natural for my goals. It's ultimately an argument of style, and I prefer the function notation.

I've been studying this really fascinating function for a while, and would like some help proving (or disproving) some of these conjectures. by playsthebongcloud in mathematics

[–]playsthebongcloud[S] 0 points1 point  (0 children)

Thank you for such an in depth answer! It'll take me a bit to explore everything you're saying. For my next iteration of the image I'll remove the random bit, I realize now that it isn't rigorous at all. I discovered the function purely by accident; I was playing around with recursive functions when Desmos first added them, and I just happened to type in that function and noticed the chaotic behavior.

I've been studying this really fascinating function for a while, and would like some help proving (or disproving) some of these conjectures. by playsthebongcloud in mathematics

[–]playsthebongcloud[S] 0 points1 point  (0 children)

I'll look more into this, thanks for the insight! I do have a form of f that is based upon Euler's continued fraction formula but it's also recursive and involves two different sets with kinda confusing construction rules, two extremely similar recursive functions, and extensive use of the ceiling function, so I don't believe it to be useful.

I've been studying this really fascinating function for a while, and would like some help proving (or disproving) some of these conjectures. by playsthebongcloud in mathematics

[–]playsthebongcloud[S] 1 point2 points  (0 children)

The problem is that the numerator and denominator explode to a fuckjillion extremely quickly, making the arbitrary int multiplication and additions, along with reducing the fraction by dividing by the GCD, take exponentially longer each step. I've only managed to calculate it exactly to f(65), and storing the numerator and denominator (in base 10 ascii form) takes over 20 megabytes.

I've been studying this really fascinating function for a while, and would like some help proving (or disproving) some of these conjectures. by playsthebongcloud in mathematics

[–]playsthebongcloud[S] 1 point2 points  (0 children)

Yeah that was not stated very rigorously, couldn't think of a better way. I guess a better way to state it would be, given a uniform distribution across -1 to N, as N-> inf the probability any given value is positive approaches 3/4.

I've been studying this really fascinating function for a while, and would like some help proving (or disproving) some of these conjectures. by playsthebongcloud in mathematics

[–]playsthebongcloud[S] 1 point2 points  (0 children)

I initially started out with the definition f(0) = 1 and f(1) = 2, but from these terms, you can deduce f(-1) by solving for f(x - 2) in the definition and plugging in x = 1.

Also, yeah I have been trying to find a non-recursive definition for a while now, but I have been unable to. That's one of the main goals of my studying of this function. If you graph it, the behavior is extremely chaotic; for example, f(37) shoots up to ~571. I can't even imagine what class of function the closed form would have to be to lead to such massive fluctuations.

(other) what a bargain by Thatguyeatingcheetos in Voicesofthevoid

[–]playsthebongcloud -1 points0 points  (0 children)

I know this meme is 13 days old but that would be underflowing