The Nineteenth Byte

« first day (1141 days earlier) ← previous day next day → last day (3999 days later) »

Jonathan Van Matre

00:14

If anyone sees this please close vote codegolf.stackexchange.com/questions/24228/… with all due haste.

Doorknob

and this one

or, you know, just come over to the bot room so you can see all the questions and comment on them accordingly

GolfEye - a chatbot

Will monitor codegolf.SE. meta.codegolf.stackexchange.com/q/1177

hosch250

Done.

Would it be too big of a hassle to notify me with your bot too?

@Doorknob

Jonathan Van Matre

And also to add "Snapchat" as a trigger word. :D

TimWolla

And WhatsApp and whatnot

Doorknob

00:39

@hosch250 meta, main, or both?

it's only changing a string in the code ;)

hosch250

Both.

Doorknob

alright

hosch250

Thanks.

Doorknob

@JonathanVanMatre meh, too rare of an edge case :P

Jonathan Van Matre

Let us hope that remains a true statement

hosch250

01:09

Does anybody know an algorithm for perfect numbers?

Doorknob

@hosch250 function() { return 4; /* this one's the best */ }

hosch250

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.

Doorknob

4 is the best number

hosch250

@Doorknob Very funny.

Doorknob

just use that

what, you think it's a joke?

hosch250

01:10

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.

TimWolla

Q: Make a codegolf scorer

You 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...

code-golf

I would have corkscrewed the pages through an XML parser. If it only was valid XML.

hosch250

01:44

Bye now, have to leave.

3 hours later…

Stack Exchange

04:44

Chris Jester-Young has removed mniip from the list of this room's owners.

3 hours later…

luser droog

07:59

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…

Peter Taylor

09:29

@Doorknob I just have the Questions page sorted by Newest.

1 hour later…

mniip

10:41

@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…

Doorknob