@trichoplax That's just insane. Like, the cheapest thing out and about here is usually soda. You can get 64oz gas station fountain soda for like $0.49 usually.
Main article: Common Intermediate Language
This is a list of the instructions in the instruction set of the Common Intermediate Language bytecode.
Base instructions form a Turing-complete instruction set.
Object model instructions provide an implementation for the Common Type System.
== See also ==
Common Intermediate Language is the assembly language that uses the instruction set.
Common Language Infrastructure is the standard in which the Common Intermediate Language is defined.
.NET Framework is a platform and implementation of the Common Language Infrastructure.
Mono is a cross-platform open...
The infinite series whose terms are the natural numbers 1 + 2 + 3 + 4 + ⋯ is a divergent series. The nth partial sum of the series is the triangular number
∑
k
=
1
n
k
=
n
(
n
+
1
)
2
,
{\displaystyle \sum _{k=1}^{n}k={\frac {n(n+1)}{2}},}
which increases without...
@Geobits @DJMcMayhem Did you watch? It seemed to say 1 viewer the whole time ;_; Jk, I just wanted to make sure the audio was ok. (youtu.be/Pir3olQlfxc)
@WheatWizard Hey, would you mind if I did a more extensive edit on your tips post to provide some more information about what brain-flak is, and to fit with the general flow of most tips questions?
@NathanMerrill Well obviously with our epsilon-definition of limits, 1+2+..+n diverges. But then you can still try to assign a real value to a divergent series (and you can do that in very different ways) and in one of these ways you'll end up with -1/12
@BetaDecay Presumably that also has to be code that can't be shortened by removing the colour requirement, otherwise it'll be deleted as insufficient effort?
@NathanMerrill You can make the range as large as you like, and still have a small but finite probability for each integer in the range, but that breaks down if you let the size of the range tend to infinity
@NathanMerrill You end up with weird properties, like the probability of your randomly chosen integer being less than N from zero being zero, for arbitrarily large finite N
@trichoplax right, I agree. The probability of each integer is "undefined". That doesn't mean that the original "uniform distribution" is undefined though
@WheatWizard Pro tip when you're offering someone a bounty: leave it up for the full 7 days before awarding it. That draws more attention to the answer which usually rewards the answerer with some additional upvotes on top of your bounty.
Assume we want to shift an array like it is done in 2048 game: if we have two equal consecutive elements in array, merge them into twice the value element.
Shift must return a new array, where every pair of consecutive equal elements is replaced with their sum, and pairs should not intersect.
Sh...
Assume we want to shift an array like it is done in 2048 game: if we have two equal consecutive elements in array, merge them into twice the value element.
Shift must return a new array, where every pair of consecutive equal elements is replaced with their sum, and pairs should not intersect.
Sh...
@NathanMerrill Just note that the probability is sigma additive. So if there was an uniform distribution with probability 0<p<1 for each number, then you could have at most 1/p numbers, but the integers surely contain more than that =)
@flawr An ant starts walking on a 1-meter rubber band, at the rate of 1 cm per second. Every second, the rubber band grows by 1 meter. Does the ant ever make it all the way around? Yes, because the rubber band grows behind the ant too.
Anonymous
I'm sure I'll get those emails too when it comes time :)
@DJMcMayhem so... I have a program that can parse bflk into a tree and vice-versa... now I'm trying to figure out the best way to implement simplification rules.
@ArtOfCode yes. When the ant is 1/10 of the way around the band, its growing .9m/s in front of the ant, but when its 9/10s of the way around, its only growing .1m/s in front
@NathanMerrill no, that would only be true if there was a fixed point on the circle, which you can't assume. Otherwise, it's permanently growing 1m/s in front of the ant, because "in front" can be all the way around the circle.
@PhiNotPi Hmm. Well a start would probably be checking if any nodes whose children are constant can be joined together, like turning (()()())(()()()) into ((()()())) or (()()[()]) into (()). Only downside is that it won't drastically shorten things
You could also do single integer golfing on any (()()()()...) chunks
@PhiNotPi What I've been meaning to do for Stack Cats for a while is brute force short programs and sort them into equivalence classes. You could do the same for short expressions.
Okay, I simulated it for a circular rubber band. The position and the circumference diverge - i.e. it doesn't work.
ant position: 1 band circumference: 200
VM337:6 ant position: 2 band circumference: 300
VM337:6 ant position: 3 band circumference: 400
VM337:6 ant position: 4 band circumference: 500
VM337:6 ant position: 5 band circumference: 600
VM337:6 ant position: 6 band circumference: 700
VM337:6 ant position: 7 band circumference: 800
VM337:6 ant position: 8 band circumference: 900
VM337:6 ant position: 9 band circumference: 1000
VM337:6 ant position: 10 band circumference: 1100
VM337:6 ant position: 11 band circumference: 1200
> Indeed, limits are very often used to find a meaningful surrogate for f(x) for those cases where f(x) is itself undefined. In the case of convergent sums, f(∞) is generally undefined (by virtue of infinity not being a number), but if the function converges to 0, we can treat the limit of the sum as the sum itself.