« first day (2041 days earlier)      last day (2804 days later) » 

2:00 PM
@Geobits Okay, so I don't post the challenge. ;_;
 
Post it if you like. I don't know which way it will be voted.
 
Okay. So I do post it :D
 
But if you want feedback, it's good practice to at least acknowledge the feedback you've already gotten.
 
Okay, so I don't. ;_;
 
I think it's fine. Make up your mind, do one or the other
 
2:01 PM
I'm not telling you whether to post or not o_O
 
That's somehow relevant
 
@Adnan Why do I feel like you're calculating every number in the sequence up to n even if they are not used
 
@LeakyNun You have to when you're using something like a(n - 1).
 
@Adnan but i don't always need a(n-1)
lazy eval please
 
@LeakyNun It doesn't calculate the same thing up to n in that case
 
2:09 PM
@Adnan for example?
 
If you really want my opinion, I think as far as "print this text" challenges go, it's pretty interesting and there's enough repetition to allow for some good compression. Usually similar challenges are , but I don't think that's a huge deal. I don't think it's an incredibly interesting challenge, but it definitely wouldn't be closed or downvoted. I would probably +1 it
@TùxCräftîñg
 
if there's another solution in a language and mine is less than half in size, would it be impolite to leave a comment saying sth like: "You can cut the nr of ops bla bla, see my answer" with link?
 
@Adnan I saw this code
pretty arbitrary if you ask me
 
2:11 PM
@seshoumara Hmm, it depends on how you do it. "You can save three bytes here" vs "My answer is way shorter"
 
:O Oasis is a new lang?
 
@LeakyNun It's to prevent memory and stack errors
 
If you're offering useful feedback, I'd say it's fine
 
Who created it? :3
 
Adnan
 
2:12 PM
@zyabin101 me :)
 
@Adnan now what's the problem with lazy eval?
 
Ninja :P
 
Yay :D
 
Hello
 
I like it from first look :)
 
2:12 PM
Hi
@LeakyNun Example?
 
@Adnan that means you don't calculate every item
 
In Brainfuck, do you fall of the tape if you go too far left?
 
@βετѧΛєҫαγ depends on the flavor
 
@Downgoat hi dwongat!
 
@LeakyNun Oh, okay, that makes stuff easier
 
2:14 PM
Most interpreters go arbitrarily far left and right
 
1 hour ago, by TùxCräftîñg
»  echo '“H i”¦… „…a' | ./ru c
Hai
 
@Downgoat Hi
 
@LeakyNun Ohh, is that also called tail call optimization?
I have no idea how to implement that
 
@Adnan I don't think so
 
@Adnan it's called lazy evaluation
 
2:15 PM
either way, I have no idea how to do that
@TùxCräftîñg Oh it's a term?
 
@Downgoat I think I'm going to do my next programming project in JS
 
In programming language theory, lazy evaluation, or call-by-need is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (sharing). The sharing can reduce the running time of certain functions by an exponential factor over other non-strict evaluation strategies, such as call-by-name. The benefits of lazy evaluation include: The ability to define control flow (structures) as abstractions instead of primitives. The ability to define potentially infinite data structures. This allows for more...
 
thanks :)
 
@Adnan What does " do?
 
2:17 PM
@LeakyNun It pushes a string, but that the dumbest thing Oasis has now.
I got to go btw
bai
 
bai
 
@Adnan farewell
 
@Adnan “B i”¦… „…a
 
So you are using the borked vertical bar
 
yes
to split strings
brbainsominutes
 
2:27 PM
0
A: The Squiggly Sequence

seshoumaraBash, 29 bytes yes $[92-$1%2*45]P|sed $1q|dc

Isn't this bash+coreutils?
 
Think so, it uses sed
And dc
 
I have 11,666 rep right now.
 
@DJMcMayhem I have 16,281 rep right now
3^5 * 67
 
cool
 
2:32 PM
CMC: do this in oasis:
27
Q: Fibonacci-orial

Leaky NunDefinition Fibonacci sequence F(n), on the positive integers, are defined as such: 1. F(1) = 1 2. F(2) = 1 3. F(n) = F(n-1) + F(n-2), where n is an integer and n > 2 The Fibonacci-orial of a positive integer is the product of [F(1), F(2), ..., F(n)]. Task Given positive integer n, find the ...

 
There's like 2 people who know oasis.
 
@DJMcMayhem you can be the third
 
@DJMcMayhem :O :D +1
 
it's really simple
 
Okay, I guess I'll try it.
 
2:33 PM
halp google cache is faster than oeis
 
Ahh yes, I do like ÐÈ sè× — BenM 2 hours ago
 
@LeakyNun @BusinessCat yes, strictly speaking my solution was in bash + coreutils. But hasn't bash become already like a synonim for both?
 
Right now, I'm trying to fix a BF answer of mine, but I'll try it afterwards
 
   hello =: 'ello'
   say =: ]
   I =: ;~ ' ' ,~ ]
   and =: ,&.>
   goodbye =: 'Hh'
   you =: ;

   you say goodbye and I say hello
Hello hello
(in J)
 
2:33 PM
I love that song
 
@seshoumara nope
 
Ok, I will change the title accordingly. I also ask since I've seen many people post Bash and Pure bash or sth like this
 
@LeakyNun I tried beating your GolfScript solution to Fractal Plus on anarchy. I ended up at the same byte count, but looking at the stats our solution must be different. Do you still have the code somewhere? Maybe we can beat 36 by combining our solutions?
(that said, I don't know GolfScript very well, so I feel like mine is probably a bit golfable anyway)
 
@MartinEnder I don't have it stored but I can try to recreate
 
I had a nice explicit form, but unfortunately both base conversion and 2-dimensional maps are super expensive in GolfScript :(
 
2:37 PM
that's true
@MartinEnder Sorry, I have completely forgotten my solution. Have fun golfing in golfscript.
 
@LeakyNun updated my entry
 
@ConorO'Brien lol hai
 
@seshoumara seen
 
This is the annoying part about anarchy
 
@LeakyNun does this ring any bells: ['+']{.{.,' '*\1$++}%\{3*}%1$++}4*n*
 
2:42 PM
@MartinEnder probably something similar
@MartinEnder You could easily change the stats by doing something like this: ['+']{.{.,' '*.@+\+}%\{3*}%1$++}4*n*
@DJMcMayhem How's it?
 
Hello, Goodbye by The Beatles?
@LeakyNun Hey, do you the best way to do a stack-safe logical NOT in brain-flak?
 
Aug 27 at 7:13, by Leaky Nun
@DJMcMayhem one-stack not (24 bytes) (consumes input) (stack-safe)
 
@LeakyNun yeah, true
 
@LeakyNun Oh cool. That's a little longer than I was hoping, but thanks!
 
@LeakyNun: Why does bc+V return 1 regardless of input? I don' think I quite understand how to build a program.
 
2:50 PM
@Emigna nope
(did you put the input in STDIN?)
 
I'm trying to fix my last brain-flak answer, but I found a bug in Wheatwizards NOR, so I'm going to need like 3-4 NOTs, and it's going to be way less golfy... :'(
 
ah, indeed I did
thanks
 
0
A: Calculate the nth term of Golomb's self-describing sequence

Leaky NunOasis, 7 bytes (non-competing) This language has one sole purpose: to out-golf Dennis in sequences. n<aae>T Try it online! Oasis is a language designed by Adnan which is specialized in sequences. Currently, this language can do recursion and closed form. The T at the end is shorthand for 1...

\o/
who on earth salt-voted it
 
@LeakyNun I don't think it's nice to say things like "to out-golf Dennis in sequences".
 
2:55 PM
Although it's a competition, sportsmanship is also very important.
5
 
14 hours ago, by Adnan
I don't want to get my ass beat by jelly again
@Adnan edited
 
Do you know if it's possible to put a link in a bounty message?
 
yes
it uses the same mini markdown as comments
 
OK, ty
 
Is anyone still attempting this?
27
Q: Fibonacci-orial

Leaky NunDefinition Fibonacci sequence F(n), on the positive integers, are defined as such: 1. F(1) = 1 2. F(2) = 1 3. F(n) = F(n-1) + F(n-2), where n is an integer and n > 2 The Fibonacci-orial of a positive integer is the product of [F(1), F(2), ..., F(n)]. Task Given positive integer n, find the ...

 
3:00 PM
@LeakyNun thanks, +1
 
@Adnan thanks
 
Bountied!
 
@Adnan Any CMC for me?
 
35
Q: Golf all the 16 logic gates with 2 inputs and 1 output!

Leaky NunFor example, the gate A and B is a logic gate with 2 inputs and 1 output. There are exactly 16 of them, because: each logic gate takes two inputs, which can be truthy or falsey, giving us 4 possible inputs of the 4 possible inputs, each can have an output of truthy and falsey therefore, there ...

 
1.  1287.670396231029   ShutUpAndTakeMyMoney
2.  1283.9383988565178  WarGamer
3.  1276.998038730706   VincentKasuga
4.  1111.5242375581379  Profiteer
5.  1102.8235144222974  DumbBot
6.  1037.2024050650048  Cheater
7.  1026.1658280539223  Spammer
8.  1015.8775789083088  DartMonkey
9.  943.0102810505733   python_starter
10. 759.7158334554806   WallStreet
11. 739.8120236024017   UncleScrooge
._.
 
3:00 PM
@DJMcMayhem just 100 rep :o
 
the two first are joke bots
 
@TùxCräftîñg What is that
 
15
Q: Stock Exchange KoTH

Nathan MerrillThe stock market is all about the speed of knowledge. Unlike previous challenges, the current stock price is not random: it is determined by those playing the game. If you can identify an under-priced stock before anybody else, then you've written yourself a money-making program. Price refers t...

^ the leaderboard of this
 
@LeakyNun Hey, I don't hit the rep cap every single day like you. I gotta be a little bit stingy :P
4
 
@LeakyNun is the sock of Jon Skeet?
 
3:02 PM
@TùxCräftîñg these scores are wrong
 
Haha, thank God Jon Skeet doesn't golf, cause otherwise we'd all be screwed.
4
 
@TùxCräftîñg It happens:
 
@NathanMerrill ?
 
This would probably work fine, except I expect there will be entries that dumb-luck their way slightly higher. There usually are. — Geobits yesterday
 
@LeakyNun How about this one: A000459
 
3:03 PM
@TùxCräftîñg my Elo system was messed up, making good scores push your ELO down
I'm rerunning right now
 
> a(n) = n*(2*n-1)*a(n-1)+2*n*(n-1)*a(n-2)-(2*n-1), a(1) = 0, a(2) = 1.
 
@LeakyNun Yes haha
 
Alright
 
I just searched for a random OEIS
 
Wow the Low-Quality post queue is always so full
Silly auto-flags
 
3:05 PM
@Fatalize "prugrammong pizzles & code golf" was what mine just created
 
CMC: solve the top post before the next one appears: stackexchange.com/questions?tab=realtime
 
@LeakyNun Nice :)
 
@Adnan thanks
@Adnan What about square without ² or * (yes this is do X without Y)
 
@LeakyNun Ahh, I'm missing a duplicate command
 
3:09 PM
@Adnan you don't need it
 
> a(0) = 0, a(1) = 1, a(n) = 2*a(n-1) - a(n-2) + 2
 
@Adnan you may try
my record is 5 bytes
 
hey Javascripters: is ES6 a huge improvement over ES5? Better put, if I only support ES5 for my next KoTH, is that going to be a problem?
 
CMC: Recommend a band or song for me to listen to right now.
 
@LeakyNun xc-»T
 
3:12 PM
@Adnan nice
 
@NathanMerrill yes
ES5 is a shit piece of shit that is just shit. ES6 is a decent OO language
 
@Downgoat what's the biggest differences between the two?
 
@NathanMerrill probably arrow funcs/TCO & real classes and inheritance
 
hm. TCO is nice, but I don't think the rest of that is necessary for a KoTH submission
especially because I'll be passing fully-built objects into JS functions
 
@Adnan here
 
3:15 PM
classes are nice for KOTH
 
@NathanMerrill hm ok
^^
 
I made a zip command line compressor wrapper. :3
 
@DJMcMayhem Oneiric Tales by Miguel Rivera
 
i was trying to make a bot selling 0 stock at Integer.MIN_VALUE and it didnt end well ._.
 
@LeakyNun Oh, it sums up the uneven numbers, doesn't it
 
3:16 PM
@Adnan yes
 
@TùxCräftîñg ._.
 
Clever
 
Tree active lines, plus a fowerth for display when using the script from shortcuts and a fifth as a note.
 
btw i made a golfing language in ruby
 
You're already finished it?
 
3:17 PM
@TùxCräftîñg is it gaot-#?
 
@echo off
rem Set ZIP_LOCATION below to the path to the executable zip.exe!
set ZIP_LOCATION=P:\ath\to\zip.exe
"%ZIP_LOCATION%" -v9 zipfile.zip %1
pause
 
;_;
 
@BusinessCat the only thing lacking for TC is comparison operators
 
There must be a gaot#
 
3:18 PM
^ yes
 
I put this script in a hidden location, and a shortcut on the Desktop.
Now, when I need to compress something, I just drag'n'drop it over the Zip icon on the Desktop.
 
@NathanMerrill how are you planning to support just ES5?
 
@Downgoat: let's make gaot#
 
@BusinessCat +1
 
3:19 PM
I'm wanting more and more to support only a subset of languages for my KoTH
90% of my runtime is communicating over pipes
 
@NathanMerrill I have a bad feeling this is rhino
 
@Downgoat its a totally different JS engine
but yes, its built on Java
 
Oh :/
 
@TimmyD ty, queueing right now.
 
@βετѧΛєҫαγ For most interpreters, it stores the code in a file and passes the filename to the interpreter. That way, all you have to do is open(sys.argv[1]).read().
 
3:20 PM
y u no use spodermonkey ;_; surely they are C++ bindings for Java
 
@Downgoat because I can pass in a Java object into a JS, and all of the properties/methods will be there
and because it'll be faster :)
 
Why not make everything in like node?
 
...because then I only support JS
 
@Dennis could you add Ru to TIO?
 
"If it is good enough, yes."
 
3:22 PM
@NathanMerrill I do not see the problem
 
it use greek letters... ?
 
I will try to learn Ru if it's on TIO
 
"One,..."
 
@Downgoat now now
 
3:25 PM
@TùxCräftîñg I'll take a look.
 
I can't use a downloaded interpreter at work :P
 
:O The bot qw has cloned seven times. :D
 
@TùxCräftîñg OH MY GOD GREEK LETTERS. SUCH COMPLEX MATH EQUATION
 
3:31 PM
@TùxCräftîñg is this answer to universe and everything because it damn well looks like it
 
»  echo '+π' | ./ru c 10
13.141592653589793
»  echo '+π' | ./ru c 42
45.1415926535898
(i golfed it; α as lhs is automatic)
 
@TùxCräftîñg rip floating-point
 
@TùxCräftîñg proof 13 & 45 are actually answer to universe not 42
 
@Dennis Pull Sequencer?
 
3:34 PM
There should be an Oasis OEIS. :3
 
»  echo 'Ϟ²π;ϟ+τ' | ./ru c
19.739208802178716
no the answer is 19
 
Oh :|
@zyabin101 Oasis?
 
@Sp3000 Pulled.
 
Oasis is the sequence golfing lang. Learn it on github.com/Adriandmen/Oasis, try it online on oasis.tryitonline.net
 
Thanks :) (just showing Martin something)
 
3:36 PM
@Downgoat ^^
 
@zyabin101 these is no raadme how to I learn it
 
btw my weird code can be golfed as ²π×2
 
@Downgoat info.txt
 
Oh ok
 
0
A: Sandbox for Proposed Challenges

NeilProducts of Consecutive Primes As of time of writing, I have 17017 reputation, which you will all be able to factorise as 7*11*13*17, a product of 4 consecutive primes. I want you to write a function or program to output all the products of two or more consecutive primes up to an input value n....

 
3:38 PM
@Downgoat the code is self-explanatory ( ͡° ͜ʖ ͡°)
 
gtg class starting
 
@Downgoat Which class?
 
@Downgoat Read my OASIS answers. I explained the language quite thoroughly in my answers.
 
CS
 
@Downgoat Good luck learning Computer Science! Goodbye!
 
3:39 PM
04515
 
@zyabin101 Hahaha I'm pretty sure I'm just gonna learn how 2 add numbers in python
 
Fun! I like cs classes
 
42
Q: How to make a Spherical Cow?

SumitBeing a theoretical physicist, I always have a great respect for Spherical Cow. So I thought about making one myself. I am not sure how can I create (something considered to be the simplest!) this marvel. One possible way could be using the ExampleData for Cow and map it on a sphere - something ...

#Users_of_Mathematica_are_weird
 
I like how Mathematica has a built-in for a 3D model of a cow
 
0
A: What programming languages have been created by PPCG users?

DJMcMayhemBrain-Flak Brain-Flak is a language designed by me, DJMcMayhem, and written as a collaboration between me and two other users, @Wheat Wizard, and @1000000000. When your Stack Overflows, you forget whatever you were talking about. If this happens very badly, to the point where you can no longer ...

 
3:41 PM
@TùxCräftîñg XD such wat
 
Finally added it
 
@DJMcMayhem I should add cheddar
 
1000000000, New York, United States
123 5
it have 123 rep and
 
yesterday, by Business Cat
12
Q: How to make a Spherical Cow?

SumitBeing a theoretical physicist, I always have a great respect for Spherical Cow. So I thought about making one myself. I am not sure how can I create (something considered to be the simplest!) this marvel. One possible way could be using the ExampleData for Cow and map it on a sphere - something ...

Super-ninja'd? :P
Anyway, I'm sure @Geobits and @HelkaHomba and a few other people will greatly appreciate this video:
 
@El'endiaStarman @TùxCräftîñg ;_; y u plagariz buisnes cat
 
3:43 PM
# [undefined](github.com/Adriandmen/Oasis), 1 byte

    n

[Try it online!](oasis.tryitonline.net/#code=bg&input=)
 
( ͡° ͜ʖ ͡°)
 
hai
 
@Dennis Oasis isn't called undefined :/
 
No repro.
What browser are you using?
 
@zyabin101 it's undefined so it's probably just u
 
3:45 PM
bai
 
  “¡ẎṢɱ»         Yield "aeuoi"; concatenate "a" with the dictionary word "euoi".
... what
 
@Zalgo @TùxCräftîñg bai
 
@Downgoat hell yeah you should
 
@LeakyNun Not my vote, but I have to say, I could do without the little victory dance every time someone outgolfs me and/or Jelly.
10
 
3:48 PM
@Dennis look I edited it already
 
I was referring to It's shorter than Jelly!. Not sure what it said before.
 
@Dennis ok
 
It ain't easy being memey.
 
@Dennis Firefox 47.0.1, Mozilla/5.0 (Windows NT 5.1; rv:47.0) Gecko/20100101 Firefox/47.0.
 
Sorry
Didn't mean to be rude
 
3:53 PM
It's in the transcript anyway. ¯\_(ツ)_/¯
 
question: anyone know what Donald Knuth contributed to linguistic theory?
 
I've asked this before, and I think one person took a stab at it, but it seems like there are more people around now. My database has 940626 rows, and this chat room has 929677 messages. I tried excluding users with user id < 0 (feed bots, mostly), but that only brought the number of rows down to 933550. So there are still about 3,883 extra rows in my database for some reason.
 
Maybe deleted messages?
 
@Dennis I don't see it. Did you purge it?
 
I already did a search-and-delete on duplicates by message id, but that only took out 172 rows.
@Downgoat They're actually not public. Open this chat room in incognito.
 
3:57 PM
@DJMcMayhem It still shows in the oneboxed answer.
 
Yeah, but not in the revision history
 
That was an edit in the grace period, I assume.
 

« first day (2041 days earlier)      last day (2804 days later) »