« first day (2065 days earlier)      last day (3073 days later) » 

00:02
Fibonacci (ignoring 0):
f=x=>x<2||f(x-1)+f(x-2)
If Fib(0) is 0 and Fib(1) is 1:
f=x=>x>2?f(x-1)+f(x-2):x>0
Much shorter than iterative
Altogether:
n=>n+n+(f=x=>x>2?f(x-1)+f(x-2):x>0)(n)+(g=(x,n=2)=>x>1?x%n?g(x,n+1):n+g(x/n):0)(n)
still don't get why JS lacks range
82 bytes
00:06
@quartata I know :P
First few items (0-indexed) are: 0,3,7,11,15,20,25,34,43,58,82,122,175,...
No OEIS sequence
(kinda figured that :P)
I checked OEIS too :P
Oh, I made a program that looks for recurrences in sequences. I'll see if that finds anything :)
@quartata short vocal cords I think
00:10
@ETHproductions whoa, really? that's cool
@ETHproductions

Test case: Input is 1000, , output is:

(3466557686937456435688527675040625802564660517371780402481729089655541794905189040387984007925516929592259308032263477520968962329873322471161642996440906533187938298969649928516003704476137795166849228875) + (2*2*2*5*5*5) + (1000+1000)

which is equal to (in scientific notation): 3.466558e+204
oh my sweet goodness that's very large
how is it that large
Fibonnaci of 1000 is why it's large.
@TheBitByte JS can't calculate that high so precisely
I'd have to spend a few hours on arbitrary-precision functions to solve that
@ConorO'Brien nothing :(
Nevermind, it's probably a bad idea to swarm that room with all the drama.
00:13
@PhiNotPi I'll be quiet I promise
@ETHproductions What's the best precision answer you can get, then?
Wait, just found out my testcase was wrong.
Google doesn't support that many characters in a search term.
WolframAlpha doesn't seem to, either.
Just checked, and it doesn't.
Okay, fixed version, @ETHproductions @ConorO'Brien:

Input is 1000, output is

(3466557686937456435688527675040625802564660517371780402481729089655541794905189040387984007925516929592259308032263477520968962329873322471161642996440906533187938298969649928516003704476137795166849228875) + (2*2*2*5*5*5) + (1000+1000)

which is then equal to:

3466557686937456435688527675040625802564660517371780402481729089655541794905189040387984007925516929592259308032263477520968962329873322471161642996440906533187938298969649928516003704476137795166849231875
I'm making great progress on my static code analyzer.
@PhiNotPi What does that do?
Does anyone know if there's a benchmark of an unrolled linked list vs linked list vs array for iteration and insertion speeds
Can't find one on Google and too lazy to do it myself
00:24
@ConorO'Brien The goal is to be able to take a snippet of esolang code, and locate as many errors as possible without actually running the code.
@PhiNotPi whoa. which esolang?
I'm trying to make it as flexible as possible, meaning that the only code you have to write for a given esolang is just a description of what all of the commands do. All of the multi-use code then does the hard work of tracking the "partial state information".
Can someone give me a false equation?
Over the reals?
00:30
x^2 = -1?
@ΛεγίωνΜάμμαλϠΟΗʹ 0 = 1
...fine, over the complexes, and no powers < 1 of 0
Not sure what you need this for
for factorial, not gamma extension
5 6+2:`'_:"``
.........E..W
^ example output for Element source code
@ConorO'Brien I don't think he wanted an inequality
x > x + 1
@quartata it's much more interesting as an inequality :P
00:33
CMC: Answer this question:
2
Q: Find expected value of length of trajectory under probabilistic mapping

LegionMammal978I'm a bit of a newbie when it comes to probability theory/terminology, so please excuse any errors on my part. Note that I ask this out of curiosity, so a full answer would be appreciated. Here goes the problem: Define the probabilistic map $M_n:\Bbb N\mapsto\Bbb N$ as follows: $M_n=\begin{case...

@Downgoat feature-request for the userscript: search for language in answer
So, to explain what that output means, it identified one error and one warning for the input program.
whoa, cool
Source?
u,?[ :( l)( l)[*,l]:l"  "l( l){*l}rd]'0u{*{*r}l' d{ l}[ (0'1d)(1'2d)(2'3d)(3'4d)(4'5d)(5'6d)(6'7d)(7'8d)(8'9d)(9'0l( '0))]u[ r]lu}d[ (0u'0)(1u'1)(2u'2)(3u'3)(4u'4)(5u'5)(6u'6)(7u'7)(8u'8)(9u'9)dl]
my work so far on prime checker
doesn't do division yet... but still
oh my
is that a string language?
no
its a grid language
turtle language
00:54
@ConorO'Brien what do you mean by "search for language"?
ye
like, given language name, link to shortest submission said language
oh
i dont really have the time tho >_>
that's okay
I'll probably work on it
@ΛεγίωνΜάμμαλϠΟΗʹ this also applies to goats
not for dragon's, most of us can make fire or something similar
00:56
@Adnan it would be borké because adjective must agree with noun AFAIK
that is correct.
@ConorO'Brien ;_; pls no set gaot on fire like bob
Jul 28 at 5:59, by Cᴏɴᴏʀ O'Bʀɪᴇɴ
@Downgoat that's actually bob. he's the outsider of the family
Jul 28 at 5:58, by Downgoat
user image
@Downgoat oh, bob broke the sacred alliance with goats. he is bad.
Dragons are the natural predators of goats. I don't understand how an alliance could be possible.
0
A: Sandbox for Proposed Challenges

Vi.Leaderboard golf code-golf stack-exchange-api Output the leaderboard of this puzzle: Leaderboard Author Language Size 1. anonymous Asm (x86) 212 ... Winners by Language Language User Score ... Just like the official snippet. No network access apart from api.stackexchange.c...

00:59
@quartata my family is nicer than that. we're shapeshifters :P
(backstory is the result of a long, convoluted, and awesome RP)
@quartata what no those are coyotes
Green and gold dragons live in the same areas, can outfly goats and have breath weapons
@quartata are you using that dungeons and dragons book?
No that I have memorized. It is sitting on the shelf next to me though
@quartata Anything can outfly goats. Except the suicidal ones.
01:03
@Downgoat can downgoats hover?
@quartata :D same, except I'm not in my room.
@quartata of my program?
Staring at several monster manuals actually
(Sorry, @ConorO'Brien @quartata I'm working on HW right now, and didn't see your messages)
@ConorO'Brien yes ^^
01:05
@PhiNotPi that's perfectly alright, good luck on HW!
@Downgoat that is a thing? o_o
odnd adnd third edition cnc and delving deeper to be precise
Goat simulator is very accurate simulation of goat's life
now to make division in my prime checker, because what I posted before is not even 20% done I think
@quartata wait I think I have a different book >_>
@Downgoat So goats are frictionless in real life too?
01:08
@quartata this is the book I had reference
@quartata I said "very accurate" not "perfectly accurate" :P
I usually just use a regular monster manual for my dragon needs
@quartata ಠ_ಠ dragons are people too
well, not technically, but you get the idea
And people are monsters usually too
that's true too
01:10
@ConorO'Brien dragons are
shit that only makes sense with goats
except for the small percentage possessed by a player
( ͡° ͜ʖ °)
> TypeError: this.gramamr is not a function
@Downgoat I have eaten dragons
;_; Javascript y u no grammr
01:11
@quartata ಠ_ಠ
@quartata ;_____; WAT. Y U DO DIS TO CONOR BRETHREN Q_____Q
In NetHack that is
oh
are they evil dragons?
@ConorO'Brien (i.e. the goat eating ones)
@Downgoat I don't think there are goats in nethack
01:12
Hey, you'd eat a dragon too for reflection or fire resistance as an intrinsic
psh, I already have those intrinsically.
@ConorO'Brien There are rothe which are basically big underground goats
@TheBitByte (2*2*2*5*5*5) is simply 1000. I think you wanted (2+2+2+5+5+5).
are they identifiable as goats by the Goat Checker(c)?
> this(3)
TypeError: this is not a function
^ favorite error
@TheBitByte My solution goes up to around 100, I believe
01:13
Goat checker?
> typeof null
< "object"
> null.foo
< TypeError: null is not an object
o_Oh, the many quirks of JS
@quartata Goat checker.
> null.foo
TypeError: Cannot read property 'foo' of null
that moment when a bug is caused by debugging code
what broken version of JS do you have
@DestructibleWatermelon 10/10
01:15
@ConorO'Brien JavaScriptCore
@DestructibleWatermelon debugging in nutshell
Probably. There are drawings of them but I don't want to boot up Mathematica
=== OUTPUT START === 0
PLS HALP THERES BORK HERE PLS
Unexpected token at 1:22
ok, I've got the decrementing working, now I just need to get the action it does while decrementing down
01:17
;_; ches, y u gotta never work
CMC: Lucas numbers
@ConorO'Brien Cheddar: n f->n?n-1?f(n-1)+f(n-2):1:2
you finally fixed recursion?
it has been fiexd for a long time
(thanks to Leaky)
oh, I see
what was the problem?
01:20
@Downgoat By the way I'm surprised you have yet to try Nethack. I figured the "you can eat anything" and the tin cans would have sold you as a goat
To play Nethack I need time. I do not have time
I think you grossly overestimate how long you'll live in one game
Lucas numbers in my new functional esolang: p^+-^Gf:&b
also you can save
@ConorO'Brien it was some crazy convoluted scoping issue. I described it in the commit message if it can even be found >_>
01:21
wat're lucas numbers pls
@Downgoat ._.
@DestructibleWatermelon fibonacci but n=0 is 2
@DestructibleWatermelon fibonacci numbers with seed [2, 1]
@Downgoat mine is more technically correct :P
01:22
;_;
I think I should just map enter to ;_;<enter>
@ConorO'Brien Hopefully fully fixed version:

CMC: Input is a non-negative, zero-indexed integer, n, always 10,000,000 or less.

Output is an integer, calculated by doing: { Fibonnaci (n) } + { sum of prime factors of "n", with multiplicity } + { n + n }

Test case: Input is 1000, output is:

(3466557686937456435688527675040625802564660517371780402481729089655541794905189040387984007925516929592259308032263477520968962329873322471161642996440906533187938298969649928516003704476137795166849228875) + (2+2+2+5+5+5) + (1000+1000)
@TheBitByte my calculations give that the 1000th fibonacci number is 434665576...8875
@ConorO'Brien Check again.
   (+/@:!&i.-)1000x
43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875
Checked.
> f=([a])=>a;f(1)
(Firefox 48) TypeError:  is not iterable
(Chrome 53)  TypeError: undefined is not a function
(IE8)        Syntax error
01:25
@ConorO'Brien Too late to edit or delete.
daemit how do this in turtlèd ;();
@TheBitByte try a pastebin instead?
Why did this and this get starred?
01:28
To whoever starred:
in Ask Ubuntu General Room, Sep 15 at 18:31, by Kaz Wolfe
[PSA] The Star button is not to be used to express agreement! Use it for funny, relevant, or potentially useful information to people in the future!
(10 stars on that message) haha
Ooh, I have 13333 rep
will star once you hit 33333
@ConorO'Brien @ETHproductions @quartata

CMC: Input is a non-negative, zero-indexed integer, n, always 10,000,000 or less.

Output is an integer, calculated by doing: { Fibonnaci (n) } + { sum of prime factors of "n", with multiplicity } + { n + n }

Use the highest precision that ensures a good amount of golfing and accuracy. Arbitrary precision is not necessary,

Test case: Input is 1000, output is:

(4346655768693745643568852767504062580256466051737178040248172908953655541794905189040387984007925516929592259308032263477520968962323987332247116164299644090653318793829896964992851600370447
just realised a lot of the code I have could be removed...
01:47
:D :D :D :D :D :D :D :D :D :D Cheddar class parsing works!!
@Downgoat turns out SLASH'EM has goats by the way
also cool does inheritance work
> parsing
parsing =/= fully implemented :P
still cosnidering whether i should have access modifiers
@Downgoat I wonder if Cheddar can solve my CMC, or is it too young of a language to have these capabilities?
I thought you said you've had everything but the parsing for a long time
Also yes you need access modifiers
I would look into how Haxe does it or add something like Objective C's @property
02:11
@Downgoat
@mınxomaτ Hello, Mr. Paul Covington!
Haha, I wish.
@quartata yes but I haven't hooked up parser to interpreter
@DJMcMayhem I'm working on implementing the people's python.
02:25
badically in interpreter/config/links.es6 you gotta define what token class links to what interpreter
Oh OK
@quartata with lambdas will it really be necessary. In OOP, the main use for properties is defining fields as private but they almost always have a accessor. Meaning with lambdas and read only fields, I think it should be fine, idk
Traceback (most recent call last):
  File "main.py", line 15, in <module>
    pos, type, str = line.split()
ValueError: too many values to unpack (expected 3)
Not always. also protected fields are important
what on earth does this mean
ರ_ರ
wait nvm I'm an idiot
02:31
Means that was an array longer than 3. You can't unpack like that
yeah
I messed up my logic
You can do a partial split instead to get only the first two
pos, type, *str = ...
like that?
yeah, like that
Would be more efficient to do split(" ", 2)
no, I need the remainder
02:37
I thought that would give the remainder
idk python
Try it in the REPL?
yeah, I need regex
>>> line = "asdf      asdf     'asdf asdfsfa'"
>>> line.split(" ", 2)
['asdf', '', "    asdf     'asdf asdfsfa'"]
Use re.split then
yeah, doing that
02:45
@mınxomaτ Then hello, Mr. Jay Adams!
@ConorO'Brien :O I was going to do that, how dare you!
Jk, sounds good to me
haha thanks
it's actually almost done
Just make sure to save something for me before you PR ;-D
@ConorO'Brien I think you mean "Haha, thank you!" :D
@TheBitByte haha thanks but I'm good
02:47
I should probably try to finish up the name list sometime...
oh shoot
I've been working on a python to people's python converter
>_<
@DJMcMayhem there's something for you to do XD
03:04
@ConorO'Brien Haha. I can't work on it rn, but if you PR what you've got, I'll take a look at it.
In a couple hours
What's your general approach?
Just replace then exec?
:P
basically yeah
03:07
Ooh, think we should make A REPL also?
oo nice idea
03:17
@ConorO'Brien And how would I identify tokens without using a regex? Not that it's impossible, but it seems needlessly hard...
alright I think I have the python to people's python thing working
@Dennis I do have considerable bias, since I write these things almost each time I write a semi-sophisticated esolang :P
i = 0
while True:
    print(i)
    i += 1
    if i > 10: break
becomes
i=0
while Dennis:
        you(i)
        i+=1
        if i>10:flawr
@ConorO'Brien I guess I'll have to take a look at your code to see what you mean. This is the first time I've written a parser for anything, so there's a decent chance it's awful not that good. :P
> while Dennis
I actually forgot about while
@Dennis you are a god among men
Not sure about that, but I appear to be True.
@ConorO'Brien if also looks suspiciously un-people-like.
that's True
I broke it :/
i = 0
while True:
    if i > 10:
        break
    elif i == 4:
        print("cosmic")
    else:
        print(i)
    i += 1
i=0
molarmanful Dennis:
   calvins i>10:
          flawr
        hobbies i==4:
          you("cosmic")
        helkahomba:
          you(i)
        i+=1
oh well, I guess I'll work on it tomorrow. night y'all
Oh dear.
At least it's avocado-free. I'm allergic.
I'm confused now
here's the gist if you want to play around with it
03:28
@confusedandamused Are you also amused?
At times
@Dennis What non golfing languages do you use day-to-day
Do you mean on PPCG or elsewhere?
Elsewhere I suppose
That only leaves Bash, although I'm not sure if terminal sessions count as programming.
Is your day job as a programmer (I assumed it was)
03:33
No. Not counting LaTeX, my work doesn't include any programming.
Hmm surprising heh
How did you get into PPCG then? o.O
Idk. If I wrote code for a living, I doubt I would make it my hobby as well.
@confusedandamused Hot Network Questions. I was quite active on Super User before I found PPCG.
If you don't mind me asking - what is your day job then?
I'm a math professor/researcher.
Interesting - what are you research areas? (or what are you interested in)
03:37
I only do pure math, so there's no programming involved.
Topology, mostly.
The only topology I've ever looked at is: en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg
But that was while I was taking a discrete math class
I'm sure you could tie programming in there if you really wanted :P
I'm a programmer but I don't like math as much as most people - solving problems is fun though
03:56
Found online yesterday: typewriter art from 1898:
user image
5
in ASCII Art Language Design, 22 hours ago, by DLosc
The whole thing was created using a typewriter. (Full article)
04:42
My brother is looking at those "top 10 video game" videos, and he gets mad every single time he sees tetris mentioned in the videos
ok, now I just need to have the loop working moar
damn bugs
my prime checker is progresseing somewhat
@Dennis do you have any papers by chance we can look at?
04:58
yo
this program is hard to make :(
05:18
@ConorO'Brien there's also ,~/ for reversing
Just discovered the native Docker support in Windows 10. Completely missed that. Pretty neat.
05:36
Hello
@DJMcMayhem Aww...
My name's not on :(
Is anyone on here?
Ayyy
Umm I have an idea for a challenge
I think
05:58
Wow, the YT Heroes trailer has a worse dislike ratio than that CoD game trailer.
YT Heroes?
I wish I knew which video on YT has the best like/dislike ratio out of all videos that have at least 1 dislike
06:03
who has heard of grobots? I just downloaded it because it seemed interesting
@Qwerp-Derp Would you like to be?
@DJMcMayhem Yeah
also, as I think about it, its kind of silly that HTML5 doesn't have any form of builtin fallback support for resources
the beginners tutorial doesn't even make sense to me very much... where is the beginners beginners guide?
Grobots?
06:10
@Qwerp-Derp which one would you like? (Provided it's still available)
TBH, doesn't really matter
round?
Done. :)
Thanks!
So now Youtube Heroes is the most disliked video based on like-to-dislike ratio
According to Wikipedia
No problem. And good night!
GN!
Ooh hey, new person!
06:53
@Qwerp-Derp yup, i don't get it very much, but I can probably learn
07:24
@Qwerp-Derp GM!
0
A: Sandbox for Proposed Challenges

Jonathan AllanInterleaved floored surd power sequences code-golfsequence Write a program or function that given: a non-negative integer, i; and a boolean isS, returns the ith number in either sequence S if isS is True or T if isS is False where S and T are defined as below (or at OEIS as S = A276219 and ...

07:44
@LuisMendo Me too haha, although they seem to be less popular at the moment :P
08:19
People of the world, I am back :)
08:56
hi
the grobots tutorials are shit
09:28
they didn't read the sign, and paid for it
09:45
HEY
HOI
I'm still making that prime checker
1
A: Ruby Brainfuck interpreter

Eli FosterGlobal variables should always be avoided, so instead of $VALID it should simply be VALID. The entire Ruby ecosystem does not need access to that variable and it might overwrite some important variable somewhere. Instead of Exception you should be using StandardError. Rubyists do not rescue Exce...

yay an answer
shit what happened to the code I thought I saved it ;_;

« first day (2065 days earlier)      last day (3073 days later) »