« first day (1744 days earlier)      last day (3105 days later) » 

12:02 AM
"Did Bill Gates just fall through the floor?" "That's... kiiinda an issue..." #CodeDay
 
@Doorknob Given your views on Windows, it's not clear why you think this is an issue.
 
12:40 AM
Hello
 
Wow. tfw you are on a computer that is so old its version of SFTP doesn't support -r.
:/
 
1:03 AM
Just saw this on Facebook. It's great.
(Note: ASL knowledge/understanding not actually required.)
 
Found the bug in FizzBuzz program.
Sadly fixing it brings it up to 33 bytes.
Also prints out "11" at the end for some reason.
Ooh I thought of an instruction that could make it 31 bytes.
Hello @user46915 and welcome to the Nineteenth Byte!
I saw your APL truth machine :)
 
making progress on the fractal generator :D
 
....I, uh, don't see much difference. :P
I like the first version the most, actually.
 
This one's much higher res...
 
@Doorknob what kinda fractal
 
Anyway, gonna go write.
 
1:24 AM
Is it a strange attractor?
 
@Doorknob My favorite :D
What are you writing the generator in?
 
C.
 
@El'endiaStarman Write code or write literature?
 
Using OpenGL for the graphics?
 
1:28 AM
@CᴏɴᴏʀO'Bʀɪᴇɴ Literature.
 
@El'endiaStarman Cool! Whatcha writing about?
 
@quartata No, it just outputs the images as a PBM, which I later convert to PNG :P
 
17 hours ago, by El'endia Starman
Tomorrow and Sunday, I'm going to try and write about 12,500 words. I'm participating in NaNoWriMo for the 5th time. :D
 
@Doorknob Cool.
 
@El'endiaStarman Whpa. That's cool.
 
1:28 AM
17 hours ago, by El'endia Starman
318 pages, 142421 words at this time.
 
@El'endiaStarman Also cool. I participated in NaNoWriMo twice a couple years back. It's really hard...
 
(It's a bit more now 'cause I've done some writing so far today.)
@quartata Especially when poor discipline leads to writing 40,000 words in the last week. :P
Done that twice. Both years that I won.
 
@El'endiaStarman hehe
 
Trying to avoid that this time by writing ~12,500 words per weekend.
 
@El'endiaStarman I know what I'm doing tonight XD
 
1:32 AM
I feel like being a rebel and making Rotor's primality test a brute-force <sqrt(n) check instead of Sieve of Eratosthenes
 
^ you are evil
 
Why?
 
rebels are evil :P
 
I mean they have the same time complexity. Sieve just runs better for small numbers.
 
@Doorknob Interesting read :)
 
1:34 AM
@quartata Sieve of Sundaram is fun to implement.
 
@El'endiaStarman I was more trying to think about "what can I implement in 5 minutes so I can post the first batch of catalog answers"
 
Incidentally, my primality testing uses a parallelized version of the Sieve of Sundaram. It's incredibly fast for most numbers because it produces only as many primes as it needs to.
 
I guess I'll just content myself with cat, fizzbuzz and Hello World and make the primality testing built in later.
 
@quartata Ahh, right.
I actually need to go update my Minkolang primality testing answer.
 
@trichoplax I'm surprised we managed to make sense of it. :P
 
1:36 AM
TFW
THIS COMPUTER DOES NOT HAVE GIT
ARGHHH
 
@Doorknob I didn't claim to have made sense of it...
 
@trichoplax yeah, I meant our group :P
 
Oh - is this an assignment? I thought you were just experimenting for yourself :)
 
No, I'm at CodeDay
 
In mathematics, the sieve of Sundaram is a simple deterministic algorithm for finding all prime numbers up to a specified integer. It was discovered by Indian mathematician S. P. Sundaram in 1934. == AlgorithmEdit == Start with a list of the integers from 1 to n. From this list, remove all numbers of the form i + j + 2ij where: The remaining numbers are doubled and incremented by one, giving a list of the odd prime numbers (i.e., all primes except 2) below 2n + 2. The sieve of Sundaram sieves out the composite numbers just as sieve of Eratosthenes does, but even numbers are not considered; the...
^ is cool.
 
1:43 AM
Wow. Could the same advantage be gained again by multiplying by 3, or does the pattern only go this far?
 
0
A: Sandbox for Proposed Challenges

Element118Rearrangement Inequality Background The Rearrangement Inequality is an inequality that is based on rearranging numbers. If I have two lists of numbers of the same length, x0, x1, x2...xn-1 and y0, y1, y2...yn-1 of the same length, where I am allowed to rearrange the numbers into the list, a way...

 
@El'endiaStarman oooooo
 
@trichoplax I'm fairly sure that this takes advantage of the fact that 2 is the only even prime.
You probably could do something similar for 3 that allows you to get primes by doing 6x-1 and 6x+1, but the extra effort might not be worth it.
 
@El'endiaStarman I'm curious now, but also sleepy...
 
Oooh, check this out:
Wheel factorization is a method for performing a preliminary reduction in the number of potential primes from the initial set of all natural numbers 2 and greater; possibly prior to passing the result list of potential primes to the Sieve of Eratosthenes or other sieve that separates prime numbers from composites, but may further be used as a prime number wheel sieve in its own right by recursively applying the factorization wheel generation algorithm. Much definitive work on wheel factorization, sieves using wheel factorization, and wheel sieve, was done by Paul Pritchard in formulating a series...
 
1:51 AM
0
A: 1, 2, Fizz, 4, Buzz

quartataRotor, 32 bytes >1N2{3%!"Fizz"~5%!"Buzz"N$?~N}\ This has one unprintable, so here's a hexdump: 0000000: 3e31 4e7f 327b 3325 2122 4669 7a7a 227e >1N.2{3%!"Fizz"~ 0000010: 3525 2122 4275 7a7a 224e 243f 7e4e 7d5c 5%!"Buzz"N$?~N}\ Explanation: > Switch to string wheel. 1 Push a one to the...

0
A: "Hello, World!"

quartataRotor, 14 bytes "Hello, World! Nothing too fancy here. Like Pyth, quotes and most other structures are implicitly closed at EOF. Check out Rotor.

\o/
 
Yay!
Waiting on cat... :P
 
@El'endiaStarman Sadly I realized that maliciously crafted inputs (like print "lol") would cause the 0-byte cat program to break since STDIN is evaluated before being put on the stack.
And since I have no other way of taking input currently, cat will have to wait.
 
Also I hope you like the explanation.
Took me ten minutes to write
I just noticed that Pyth is 30 bytes. :/
I thought it was 32.
Guess I'm not outgolfing anyone.
 
@quartata Hmm? What about like, most of the other answers? :P
 
1:55 AM
It's a hollow victory.
I'm tied with Pip... ugh
Maybe there is a way to golf this down I don't know about.
 
i think I broke spotlight search
 
When your YouTube ad is an ad for the video you're trying to watch.
3
 
AdBlock!
 
On YouTube app :\
 
2:06 AM
0
A: Sandbox for Proposed Challenges

Samed Tarık ÇETİNPrime Numbers Goal: Take no output and print first 100 prime numbers to STDOUT. All standard code-golf rules are applied. Shortest code in byte wins. Restrictions: No usage of built-in or external methods or functions that returns a prime number. Any suggestions? Thanks.

 
...that sounds like a duplicate.
 
On codegolf.stackexchange.com/questions/63256/… I've invalidated 7 answers and counting with the same input.
Hopefully I don't get automatically banned or something for pasting the exact same comment 10 times.
Out of 13 answers on that question, at most 3 were correct.
 
Hello
 
"Let's malloc(1000000) just to be safe." #CodeDay
 
Who's KeyboardFire?
 
2:16 AM
me :P
 
Oh, okay.
 
What is the policy for untestable answers?
 
delete on sight?
(link?)
 
Answers in unimplemented languages are not allowed.
But there are many other reasons it may be untestable too.
 
I've got an answer to a question that doesn't work in the current interpreter because it's being rewritten
 
2:19 AM
Just added a factorial example to the esolang article on Microscript
 
@phase can you link to an old version of the interpreter?
(if it's on Github, for example, you can)
 
In the answer, I'm using some features from the old interpreter, which aren't implemented in the new one, and some features from the new one, which aren't in the old one.
 
In that case, you probably should finish the new interpreter first.
(Assuming that you're the one writing it.)
 
Uhm. Does there exist a publicly available version of the interpreter than can run your code?
 
2:20 AM
here at microsoft, we don't believe in open source
 
... so that's why they open sourced a large portion of .NET core? >.<
 
@Doorknob Not currently. I guess I should probably just reimplement the features I need :P
 
here at microsoft, we don't believe in doorknobs.
 
@Seadrus like 1000% of F# is open source
 
@Seadrus D:
 
2:22 AM
@Seadrus What.
 
here at microsoft, we don't believe in anything but doorknobs. we therefore have desks constructed of doorknobs.
 
o.o
 
I hope you're not going to be one of those people who tries to write an interpreter without knowing what malloc is.
 
@Seadrus But you just said you didn't believe in doorknobs either
 
here at microsoft, we believe in contradictions.
 
2:23 AM
@feersum wait who are you talking to?
 
@Doorknob phase
 
Seadrus is just not making sense. Like the action his avatar portrays.
 
@feersum @kirbyfan64sos is doing most of the segfault and memory debugging
 
oh
 
I'm just kinda there like "oh wait you forgot to implement this"
 
2:25 AM
here at microsoft, we don't believe in belief.
 
Well, goodbye for now.
 
Here at Apple, we have no idea what the hell we're doing without Steve Jobs.
5
 
Here at PPCG, we don't give a **** for the outside world.
 
11th broken answer found...
 
Probably a fault of the question not including example inputs and outputs that included edge cases.
 
2:29 AM
@feersum I don't quite believe that over 10 answers are broken...
 
Yeah, mine is fixed.
 
@phase Test them for yourself. None of the 11 answers I commented on should work for the input falstrue (except ones which have been revised).
 
@feersum What should be the result?
 
falseslaf
 
@feersum Just tested @Maltysen's answer and it failed on the test, but worked for everything else I could find... pyth.herokuapp.com/…
 
2:36 AM
@phase So what? An answer must give the correct result for all inputs, not just some of them.
 
To put it another way, an answer that's 99% correct is wrong. :P
 
No idea what is happening...
 
jetphotos.net/photo/8100297 that is a big plane
 
@TheDoctor Judging from the length of the runway and the size of the wings, I'd say it's at least oh wait no one cares
 
@Doorknob how goes code day?
@phase its an A380 iirc
 
2:45 AM
@TheDoctor wow
 
@TheDoctor O.O Woah!
 
/me needs a new amplifier with less scratchy volume controls
 
@TheDoctor fractals are very fancy :D
 
'Hoy
 
want codes
 
2:48 AM
What for?
 
@TheDoctor an old version is on Github
^ example output
ok, I pushed all the code I have so far @TheDoctor: github.com/KeyboardFire/cfractal
 
@Doorknob How are you outputting it?
 
PBM
converting to PNG with ImageMagick
 
What are you doing that's taking time? I seriously don't see that much difference between the versions you've posted in here.
Like, how are you improving it?
 
I'm adding different variations and working on command line args and stuff
also, before I was only posting about 1% of the outputs
now they all look at least decent
my friend may or may not be working on a webserver interface
 
2:56 AM
ahhh, okay
 
(that's why I need command line arguments to work in a friendly manner)
 
uh-huh
cool!
 
It doesn't seem to be working
 
my code?
run it like make && bin/fractal 1 2 3 6 16 17 > out.pbm && convert out.pbm out.png or something like that
 
Yeah, I compiled it in gnu99 mode (the only mode in which gcc was willing to accept it) and it gives me an error when I run it.
Downloading the makefile so I can try it that way
 
3:00 AM
Goodnight everyone!
 
G'night!
 
@SuperJedi224 oh yeah getopt doesn't work with C99 mode ugh
Works on My Machine™
(maybe clang would work better?)
^ the Disc variation gives interesting results :D
 
ooooh...
 
Error on line 8: Expecting target: Dependencies
 
wut
 
3:03 AM
I think I got it working.
Compile as g99 and call with 5 numbers.
But there still seems to be a problem with your makefile.
 
3 mins ago, by Doorknob
Works on My Machine™
 
Wait, I don't seem to have the convert utility.
 
it's in ImageMagick
if you have an image viewer that can view .pbm you don't need it
 
Every now and then a post comes along that I want to downvote twice. Am I the only one here without a sock or something?
 
@Geobits who's @Seadrus then?
i thought he was ur sock
 
3:06 AM
Your guess is as good as mine. If I had a sock it wouldn't be so "obvious".
The avatar at least would be the same size and transparent.
 
You should make it print something to the console and terminate instead of producing a "fractal.exe has stopped working" error popup if you provide the wrong number of arguments.
 
eh not important :P
 
@Doorknob make isn't working. its telling me to use C99 mode because of for loops implicit delerations
 
I know, SuperJedi said the same thing
not sure why it works for me, then...
 
C99 doesn't quite work either, use GNU99.
 
3:12 AM
anyway, usability comes last, because limited amount of time and I still haven't even started a GUI :P
 
Are you doing this for something or just don't have time to work on it?
 
Are fractal flames actually fractals, or are they called "fractals" just to indicate their fanciness?
 
@phase I'm at CodeDay
@feersum uh not sure about that
 
They don't look self-similar.
 
What is this error and how can I kill it? i.imgur.com/gqb7LwG.png
If I try http://, it just redirects to https://
 
3:15 AM
@SuperJedi224 do I just put FLAGS=-std=gnu99 at the top of the makefile?
 
@Maltysen I don't know, I've never put together a makefile before.
 
oh how did u compile it in gnu99 then?
 
Probably like gcc -std=gnu99 *.c ?
 
I just called gcc on it directly with the -std=gnu99 flag
 
oh thanks
 
3:25 AM
dammit
this x86 instruction reference causes my LCD to emit an annoying sound
2
 
3:42 AM
Microscript II has now been officially released!
 
@SuperJedi224 y u no github
 
@Doorknob i made a snappy 3 minute web interface for you
 
@phase Because, although I do have a github account, I never really got around to doing anything with it for some reason.
 
@Maltysen my friend already made a web interface :P
 
@SuperJedi224 Just git add -A , git commit -m "message" , git push https://github.com/SuperJedi224/Microscript2
 
3:49 AM
doih
 
@Maltysen how u do dis
I'm rewriting the O IDE in Python, and I suck at Python
 
do what?
 
Well, goodbye for now I guess.
 
@Maltysen web interface
 
3:51 AM
looks good to me
steals crappy code
 
i would gladly write the o web ui for you in python cuz im bored
and python web uis are fun
 
yeshhh
hold on let me push my code
 
My Rotor catalog answers have not been showered in praise like I had expected.
3
 
@Maltysen Here's the current code. The interpreter is now written in C, and I need to call it from Python. The new IDE needs to basically be this, but translated into Python.
 
Blaming @SuperJedi224 for releasing MicroScript II on the same day in 5... 4... 3... 2... 1...
 
3:55 AM
kk
 
oh lol ide.py: import os\nimport sys\n\nif __name__ == "__main__":
 
@Maltysen That's as far as Python as I go
 
@phase Have you considered the benefits of using Groovy
 
@quartata I love Groovy but haven't had a chance to use it in any projects
 
3:57 AM
do i just gcc o2.c?
 
@quartata I was thinking about rewriten PhaseBot in Groovy, but that would just be waisted time.
@Maltysen Yup! (and please do -o o
 
> waisted
 
hipped
shouldered
 
Anyways, I'm going to pretend like no one saw the FizzBuzz answer I spent all day on and post it again
 
@mınxomaτ How does one do le secret replys?
 
3:59 AM
1
A: 1, 2, Fizz, 4, Buzz

quartataRotor, 32 bytes >1N2{3%!"Fizz"~5%!"Buzz"N$?~N}\ This has one unprintable, so here's a hexdump: 0000000: 3e31 4e7f 327b 3325 2122 4669 7a7a 227e >1N.2{3%!"Fizz"~ 0000010: 3525 2122 4275 7a7a 224e 243f 7e4e 7d5c 5%!"Buzz"N$?~N}\ Explanation: > Switch to string wheel. 1 Push a one to the...

@Doorknob ha ha
@phase That wasn't a secret reply. That was a regular reply.
 
@quartata But it doesn't have the tag in it
 
Mouse over a message hit the arrow thing hit reply
 
@phase Just click the reply button. Not very secret...
 

« first day (1744 days earlier)      last day (3105 days later) »