« first day (1141 days earlier)      last day (3709 days later) » 

12:14 AM
If anyone sees this please close vote codegolf.stackexchange.com/questions/24228/… with all due haste.
 
or, you know, just come over to the bot room so you can see all the questions and comment on them accordingly
 
Done.
Would it be too big of a hassle to notify me with your bot too?
@Doorknob
 
And also to add "Snapchat" as a trigger word. :D
 
And WhatsApp and whatnot
 
12:39 AM
@hosch250 meta, main, or both?
it's only changing a string in the code ;)
 
Both.
 
alright
 
Thanks.
 
@JonathanVanMatre meh, too rare of an edge case :P
 
Let us hope that remains a true statement
 
1:09 AM
Does anybody know an algorithm for perfect numbers?
 
@hosch250 function() { return 4; /* this one's the best */ }
 
I am using the 2^x and 2^x * p algorithm's, but my code is still really slow when I brute force the rest.
 
4 is the best number
 
@Doorknob Very funny.
 
just use that
what, you think it's a joke?
:P
 
1:10 AM
Yes.
Oops, practical number.
This is the equation for perfect numbers:
`(2^(x-1)) * (2^(x) - 1)
That reminds me, perfect numbers are practical numbers, so I can try that too.
 
0
Q: Make a codegolf scorer

PyRulezYou are too make a program that given a number, such as 22009, will go to, for example Pi Calculation Code Golf. Then it will, for each answer, try and figure out what the code is, and count its characters. It will then output, for each answer, its number of characters, and a link to it. It shoul...

I would have corkscrewed the pages through an XML parser. If it only was valid XML.
 
1:44 AM
Bye now, have to leave.
 
 
3 hours later…
 
3 hours later…
7:59 AM
I wonder ... If I take my Lukasiewicz Logic Interpreter, which operates on what it calls "positive formulas" (expressions with sufficient operands for all operators), and extend it to allow negative formulas. These are formulas with insufficient operands, == un-applied functions == lambdas!
New operands would then be taken from the input file.
I wonder if this would supply a universal basis.
It has 3 operators: N = monadic negate, K = dyadic and, A = dyadic xor.
And a binary alphabet: 0, 1.
So "KAA" would read 4 bits from input, and compute .... Aha. first problem: KAN are not in the alphabet.
Back to whatever you were doing ....
Hm. Ok, if it operates on bits, then it can process from a 1-byte input buffer, and a 1-byte output buffer. So it can build-up 'K", etc. bit by bit.
Hm, no. Still no way for 'K' "quoted" to pass through and apply later.
 
 
1 hour later…
9:29 AM
@Doorknob I just have the Questions page sorted by Newest.
 
 
1 hour later…
10:41 AM
@luserdroog There are a few problems with forking and moving values around partially applied functions
Consider these 3 functions in haskell:
(/4)
(4/)
join(/)
 
 
2 hours later…
12:24 PM
@PeterTaylor But the nice thing about the bot is that it's a chatroom, so you can just comment on the posts as they appear. Also, it detects some triggers that may indicate bad quality questions. I'm planning to add more features but it's spring break week for me and I'm going somewhere.
(that also means the bot will not be running this week)
 
12:59 PM
@PeterTaylor Wow, are you using, like, Pentium? My computer is just a laptop with an i5. (notice that the program only uses 1 core)
 
1:40 PM
Intel Core2 Quad Q8300 @ 2.50GHz
 
1:58 PM
Mind pastebinning your cpuinfo?
 
 
2 hours later…
 
8 hours later…
11:59 PM
 

« first day (1141 days earlier)      last day (3709 days later) »