I'm amused by the mental image that this is actually happening, right now, and you are somehow managing to post from the middle of some lake. — Amadeus92 hours ago
@Rainbolt My brain did a s/no/any/ when I read the question... :-/
@NathanMerrill In Haskell, for built-in lists (which may be infinite) there's simply separate ways to get the head and the tail of the list, so when you want to do something with it you can take care of keeping the remainder of the list yourself. (You'll usually write a recursive function that processes the head and then calls itself recursively on the tail.)
But if you want an object that appears to be stateful like an iterator in an imperative language, then yes you'd return the new "modified" iterator along with the current object. Haskell provides some syntactic sugar for this which makes it a bit more convenient to use (Monads? Monoids? Something... Haskell has a bunch of related concepts in that area.)
@Rainbolt Some languages have a "negative yes" (that is only used to disagree with a negative question). In those languages, "no" is actually the affirmative answer to a negative question. I find it makes a lot more sense, but at least in German people get it wrong all the time anyway.
@Geobits @ETHproductions @TùxCräftîñg @Downgoat @ConorO'Brien (and other bot operators): Due to the issues of SE chat (rate limiting, cumbersome interface, etc) I'm considering opening up a room (or several) on another chat service for use by our chatterbots. If any of you have opinions on which service to use please ping me with them and I'll make a comprehensive strawpoll
@quartata Let's make sure it's easy for bots in javascript to use as well..... Not sure how well that would work in IRC. Also, slack does have a bot API, but I don't know very much about it
@quartata Also we could just make a chatroom ourselves.... ?
If I want to determine the number of a particular combination of 17 integers from from 1 to 5 million out of all the possible combinations of 17 integers from 1 to 5 million, how would I do that?
I have the following code, but it takes too long to execute.
import itertools
def Combinations(lis...
Create a routine that takes an array of blocks in one numeric base system, and convert them to an array of blocks in another numeric base system. Both the from and to systems are arbitrary and should be accepted as a parameter. The input array can be an arbitrary length (If using a language whe...
> old Insider Preview builds will start to see build expiration notifications once a day. Then on October 1st, these PCs will start rebooting every 3 hours and then on October 15th – these PCs will stop booting all together.
um it answers a few questions like "what do you think about", "what's up" with random answeres from a list, but I'm gonna get some random data from TNB to expand what it will respond to
to lazy to rn though, im just fixing bugs currently
Does anyone know of any good machine learning datasets? I might want to make a node.js bot, (unless they are hosted in such a way where I wouldn't have to donwload them)
@quartata I guess it wouln't really be machine learning.... But something I could use that would be better than probing TNB and finding what common replys are to different common messages/questions.
It's a generic "do this numeric algorithm" challenge, but I think I've framed it in a way that presents opportunities for good golfing (it involves arrays and bitwise operations).
Perform Dempster's Rule of Combination
Crash Course on DST
Dempster–Shafer theory (DST) provides a method to combine various sources of evidence to form a belief. Given a list of possible statement (one of which is the true answer), each possible combination of statements is assigned a "mass" ...
Repetition
In a language called Repetition (something I just made up), there consists an infinite string of 12345678901234567890..., with 1234567890 repeating forever.
The following syntax is available to output numbers:
+-*/: This inserts the operator into the string of repeating digits.
E...