The Nineteenth Byte

Anonymous

7:04 AM

@El'endiaStarman I can't figure out how :/

Anonymous

It's worth noting that basically every Pancake Stack command (with the exception of the label commands) is translatable to 2-3 Seriously commands

Anonymous

So it may be easier to conceptualize in a terser language :P

El'endia Starman

Well, yeah, if/when I make the challenge, I'll make all of the commands one letter.

All the relevant ones, that is.

Input and output don't matter for this task.

grc

@El'endiaStarman are you sure that's true?

El'endia Starman

> Pancake Stack is Turing complete assuming stack values are unbounded, as it can easily simulate a two-register Minsky machine using the top two stack values as registers.
> Alternatively, if stack values are bounded, then Pancake Stack is not Turing complete, as it can be simulated by a push-down automaton. Some trick is needed to support incrementing/decrementing all values simultaneously, e.g. one could keep track of a separate value (in the automaton state) to be implicitly added to all stack values.

Source.

grc

7:09 AM

I mean that it's turing completeness implies that rotating three elements is possible

El'endia Starman

hmm

Aren't Turing complete machines/languages able to simulate the whole universe?

(Which is Awesome but Impractical, yes, but still...)

grc

so it could simulate a stack where rotating the top 3 elements is possible

El'endia Starman

I guess so.

grc

but I don't think that necessarily means you can do it with the built-in stack

El'endia Starman

hmm

What about copying over stack values?

Or maybe input would be required.

grc

7:16 AM

what do you mean?

Anonymous

@El'endiaStarman flags TvTropes link as offensive

El'endia Starman

How is that offensive?!? I mean, sure, it'll suck all productivity out of your life, but that's not offensive!

Anonymous

Runtime input is not required for TC - you can get by with hardcoding input

Anonymous

@El'endiaStarman I was joking :P

El'endia Starman

I know. :)

Anonymous

7:18 AM

So the IO ops are unnecessary

El'endia Starman

@grc If it's not possible to do it with the built-in stack, and it's not possible to copy over values from the stack, then perhaps it can be done with input.

Anonymous

I can easily do it with input:

Anonymous

Output this string: hey, user, input these three values, in the order 2nd, 3rd, 1st:

Anonymous

Then output top 3 pancakes

Anonymous

Boom done

El'endia Starman

7:20 AM

ah

Anonymous

But relying on user input is cheating

El'endia Starman

Input as in "input the stack exactly in the order it's in".

Anonymous

Therefore it must be possible without I/O commands

grc

it's easy if you can execute commands between each input

Anonymous

7:35 AM

Wake me up if there's a bug in Seriously or you guys figure out the pancake problem

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Code Billiards Unlike code golf (going for the shortest program possible) or code bowling (the longest possible), I came up with code billiards, where the user would have a number of tasks to write programs for (all in one language). The goal would be to minimize the Kolmogorov complexity betwee...

VoteToClose

7:54 AM

@Dennis You should add a Vitsy interpreter on your site. c;

Also - I've decided to focus on three languages: AppleScript, Vitsy, and Minecraft. These are the languages I've done best with.

El'endia Starman

8:19 AM

One instruction set computer

A one instruction set computer (OISC), sometimes called an ultimate reduced instruction set computer (URISC), is an abstract machine that uses only one instruction – obviating the need for a machine language opcode. With a judicious choice for the single instruction and given infinite resources, an OISC is capable of being a universal computer in the same manner as traditional computers that have multiple instructions. OISCs have been recommended as aids in teaching computer architecture and have been used as computational models in structural computing research. == Machine architecture == In a...

It's amazing that these exist.

TanMath

@VoteToClose there is a language called Minecraft?

VoteToClose

Yes - it's the game, MineCraft, using command blocks and logic gates.

TanMath

@VoteToClose oh... Like building minecraft computers? That is hard.. have you built one?

TanMath

8:32 AM

@MartinBüttner I have fixed the code:

3

A: Sandbox for Proposed Challenges

Squares of squares Premise One night, I was just contemplating on numbers. I found out about something unique about numbers like 7, 10, 12, 13, and more. They are squares of squares! Meaning, that when squared, are comprised of squares themselves. The OEIS calls them Squares which are a decimal...

I haven't run it just yet...

VoteToClose

@TanMath Just logic gates and stuff. I'll link in an answer of mine.

10

A: Implement a Truth Machine

Minecraft, 18 Bytes (MC Version 15w45a) As you can see, there is a lever directed into the repeating command block, which has the command say 1 in it. There is an signal inverting torch on top of that, which directs power into the single-run command block with the command say 0 in it. Wheneve...

TanMath

@VoteToClose cool!

@MartinBüttner ok. so the code just keeps running. but nothing has happened (using ideone)...

El'endia Starman

8:52 AM

How do you even multiply the top two elements of the stack with Pancake Stack?

Sp3000

@El'endiaStarman Haven't tried, but probably something silly like repeated repeated increment

El'endia Starman

@Sp3000 That's what I thought of, but you can't specify how many times a loop runs.

Sp3000

You can decrement the top of the stack, right?

El'endia Starman

yup

(And increment as well.)

You can also decrement and increment the whole stack.

You can only make the decision on whether to jump to a label or not based on the top of the stack.

You have duplicate, swap, pop, add, and subtract.

Sp3000

Then you can do at least one set of loops with the top of the stack... not sure about 2 though, don't have access to a computer atm

Might not need 2 with add

grc

9:02 AM

the problem is that you only have easy access to the top two values on the stack

TanMath

hello!

goodbye!

Martin Büttner

@TanMath I think it's because you've indented i=i+1

you can also make code much faster by checking if r(i*i, str(i*i)) and then returning i itself instead of sqrt(i).

TanMath

@MartinBüttner true.. but it really doesn't matter...

El'endia Starman

Okay, I've kinda figured out how to add A and B without losing them.

TanMath

still doesn't wrok...

oh well, i will solve it tomorrow!

Sp3000

9:10 AM

Push 0, swap, increment rest of stack while decrementing top until zero?

El'endia Starman

...that's way simpler than what I was thinking.

A, B (start)
A, B, 0 (push 0)
A, 0, B (swap)
loop until top is 0 {
A+1, 1, B-1 (increment all once, decrement top twice)
}
A+B, B

Now, how do we leverage this to get A+A, B?

grc

A+A, B is easy, but then you lose A

El'endia Starman

So now the question is, how do we do A+A+A?

grc

I'm beginning to doubt whether this is actually turing complete...

El'endia Starman

yeah...

Ha, first four items on the star board have exactly five stars each. :P

grc

9:17 AM

fixed

El'endia Starman

.... :(

grc

star it again to get 5 5s

El'endia Starman

I've already starred all four!

I could unstar the other three, but that's a bit unjust...

Anyway, actually, there is a way to get 3A.

A (start)
A, A, A (duplicate twice)
A, 2A (add)
A, 2A, 2A (duplicate)
A, 4A (add)
4A, A (swap)
3A (subtract)

grc

why not just (duplicate, add, add)?

El'endia Starman

....um....

'cause overcomplication is better? >_>

grc

9:21 AM

:D

El'endia Starman

Yeah, that's far simpler.

grc

but I'm pretty sure you can't multiply :(

El'endia Starman

> A Minsky machine is basically a finite-state automaton with access to a number of unbounded registers or counters. These registers can be thought of as monosymbolic stacks (i.e. stacks of all the same symbol.) Two operations are available on each register: 1) increment it; and 2) decrement it unless it is zero, in which case follow an alternate state transition.
> Minsky machines with two or more registers have been shown to be in the same computational class as Turing machines. Because of this, and because of their simplicity, they can be used to prove several esoteric programming langua…

Sp3000

If Pancake Stack had decent I/O, I'd consider using it for more challenges tbh :/

But yeah I've never tried the 2 number Minksy thing myself, so I'm curious how that'd go

xnor

so in Python, I have a list of unknown length, and I want a slice of every k-th element so that the i-th to last element is included

i haven't found a non-horrible way to do this

Sp3000

9:30 AM

Example?

El'endia Starman

Well, I posted that really more to show that the claim of Turing completeness on the Pancake Stack esolangs page is, well, valid. So there must be a way to multiply the top two numbers of a stack.

grc

*turing complete with a caveat

xnor

@Sp3000 say l=[0, 1, 2, 3, 4, 5, 6, 7, 8, 9] and I want every 3rd element, including the second-to last one, giving [2, 5, 8]

k=3, i=2

actually, i=1 since i'm zero-indexing

one way would be reverse, do [i::k], then reverse again

Sp3000

l[~i::-k][::-1]?

That's probably the problem you're pointing out, isn't it :/

xnor

yes, that's the best I have now

El'endia Starman

9:35 AM

([0]+z)[::3][1:]

Aww, that's no better.

Sp3000

Hm...

El'endia Starman

z[i:][::k]

xnor

that's z[i::k], and takes the i-th element from the start, not the end

binary expansions really are more mathematically natural if written backwards

El'endia Starman

Well, it gives the result you want with the example you gave, so I still don't understand.

xnor

let's take k=7 instead

Sp3000

9:41 AM

Hmm keeping the nth last from the end is pretty unusual - what's this for?

xnor

2

A: Enumerating N-Dimensional Vectors

Python 2, 62 lambda z,k:[int('0'+bin(z)[~i:1:-k][::-1],2)for i in range(k)] This code is ugly and golfable, but the idea is very simple. Pack k binary expansions into one by reading every kth digit with different offsets. For example, with k=3, the input 357 maps to (3,0,7): 101100101 <- ...

I'd like every kth digit from a binary expansion

El'endia Starman

@grc ....AH....WELL THEN.

Okay, what's a good way to say "this language can actually do something non-trivial and naturally"?

xnor

@Sp3000 actually, i just thought of a totally different implementation

Sp3000

Oh?

xnor

it doesn't work

def g(z,k):
 l=[0]*k
 while z:l=l[1:]+[l[0]*2+z%2];z/=2
 return l

the number of rotations is not always a multiples of k

Lembik

9:49 AM

hi al

Martin Büttner

who is Al?

Calvin's Hobbies

@MartinBüttner Al. Hi Al

Lembik

you can call me Al

Paul Simon - You Can Call Me Al

►

Calvin's Hobbies

ok betty

Lembik

how would you make a random 6 character string in python?

xnor

9:55 AM

from what set of characters?

are you looking for golfed or well-coded?

Optimizer

what's the difference ?

Lembik

@xnor well coded!

just ascii + digits

I tried

random = ''.join([random.choice(string.ascii_letters + string.digits) for n in xrange(6)])

doesn't quite work

xnor

what goes wrong?

Lembik

hmm

some oddity..2 secs

Calvin's Hobbies

@Lembik That looks fine. Do you want avoid duplicates?

Lembik

9:59 AM

sorry it was just python weirdness. or more accurately total lack of error checking

I had used a module name as a variable

but of course it didn't tell me anything was wrong

all fine now :)

@Calvin'sHobbies avoiding duplicates would be good

but actually I need to made a hash table I think

Calvin's Hobbies

How about x = ''.join(random.sample(string.ascii_letters + string.digits, 6))

Lembik

even better!

thanks

feersum

10:21 AM

@MartinBüttner What version/interpreter for Ruby do I need to run brianchuck?

Sp3000

@feersum Not Martin, but I have 2.1.5 and it works for me

Calvin's Hobbies

Are we getting more unanswered questions? Of the 104 I count that 2 are from 2012, 6 from 2013, 17 from 2014, and 79 from 2015. It's nearly the end of 2015, are these rates normal? (cc mods @MartinBüttner @Doorknob @Dennis @AlexA.)

I know the older questions have had way more time to be answered and our question rate may be increasing, but still.

Optimizer

I think its just the same (or somewhat similar) percentage if you stack it up against incoming questions

Calvin's Hobbies

Are we really getting 7.9 per day o.O

Does that include closed ones?

Optimizer

10:41 AM

I think so.

we were getting 8.5 too

feersum

Why don't more interpreters have a maximum memory option like -Xmx in Java?

@Sp3000 Seems to work so far, thanks

Martin Büttner

10:58 AM

@Calvin'sHobbies a) As Optimizer said, we're getting a lot more questions these days. b) Older questions have had more time to get a late answer after a while.

@feersum Do you want to beat my cat program? ;)

feersum

I'm testing the answers to unusable language.

Martin Büttner

ah, right

VoteToClose

11:21 AM

Anybody know why this question was down voted?

PhiNotPi

What happened to weshouldblamedoorknob.tk?

New Sandboxed Posts

11:41 AM

0

A: Sandbox for Proposed Challenges

Compile regexes Your task is to compile regexes. Regexes. The regexes support these REGEX = (LITERAL REGEX / GROUP REGEX / LITERAL STAR REGEX / GROUP STAR REGEX / ALTERNATIVE) STAR = REGEX '*' GROUP = '(' REGEX ')' LITERAL = 1 / 0 ALTERNATIVE = REGEX '|' REGEX Why onl...

VoteToClose

11:59 AM

o-o Exact opposites.

Optimizer

upvotes in that questions are upvoting the negativity, so its -15 only :P

VoteToClose

O.o How does that work?

Optimizer

magic

VoteToClose

o-o I think I know who upvoted this...

Optimizer

12:20 PM

?

trichoplax

12:34 PM

Golf tips questions elsewhere on SE:

3

Q: How can I minimise the code needed to run this custom function?

I'd like to shorten one of my scripts and I got na idea but I dont know how to do that. Have a piece of code like this: COMMAND="find /etc -type " case $1: "directory") $COMMAND d ;; esac Of course this is the short version :) And now I want to be able to shorten it, not towrite that $COMMAN...

Optimizer

noobs

JimmyJazzx

@VoteToClose Seems a Little Vauge in what its asking. But I agree not sure what the downvotes are for.

anOKsquirrel

1:34 PM

Wello people

Optimizer

2:16 PM

He-wub-wub-wub-wub-wub-wo my Sock!

Martin Büttner

This is probably the most heavily golfed Brian & Chuck program to date:

0

A: Implement a Truth Machine

Brian & Chuck, 21 bytes ,}<-{-?<SOH>_{+? _>+{?<.p Here, <SOH> should be replaced with the corresponding control character (0x01). Explanation The basic idea is to subtract the character code of the input (48 or 49) from the p at the end of Chuck, which will either give a ? (which is a valid ...

Optimizer

Why didn't you name it Chunky and the Brain ?

Martin Büttner

because I didn't

Optimizer

-1

Stefnotch

(I can't give out downvotes just yet...sucks)

trichoplax

2:41 PM

@Stefnotch You can still link to things here if you feel other people may be interested in downvoting...

Stefnotch

@trichoplax
LOL! That sounds like a really good/bad idea!
So, this seems like something you might want to downvote: http://computergraphics.stackexchange.com/questions/203/are-there-common-materials-that-arent-represented-well-by-rgb

trichoplax

@Stefnotch Hmm, for some reason it won't let me :P

VoteToClose

I tried to expand the votes. -.-

@Mego Your language is Seriously awesome. c: Can you add some tutorial docs/example usage to the github page?

Stefnotch

3:06 PM

@MartinBüttner "read a single character from STDIN and push its byte value. Pushes -1 once EOF is reached."
How should I implement the input? (prompt() or <textarea>) Does the input get "deleted" after reading from it?

Martin Büttner

the best option would be to provide a text area (which has to be filled before the program runs) and then read characters from it if requested.

like cjam.aditsu.net does

Stefnotch

@MartinBüttner Ok! (Great, I don't have to change anything! :D )
I would need some variable that keeps track of which characters have been read, right? (Or I could read all of them at the beginning, store them in a variable...)

Martin Büttner

yes, store it as one large string in a variable, and then keep track of some sort of "input pointer" (starting at 0) which you increment as you move through the input

Stefnotch

@MartinBüttner Ok! :D

Martin Büttner

btw, when you implement . (character output) please take the integer modulo 256 before converting it to a character (and use proper modulo, such that -1 becomes 255). that isn't in the language spec or the reference interpreter yet, but I'm going to change that soon.

New Main Posts

3:15 PM

2

Q: Get The Getters

The Task I guess everybody loves automatic code generation and saving some time during work. You have to create a lot of classes and members during the day and you don't want to create all those getters manually. The task is to write a program or function, that generates getters for all class m...

code-golf

Stefnotch

@MartinBüttner So, the built in Javascript modulo wouldn't work?

Martin Büttner

no unfortunately not

(Labyrinth's own % expects modulo to work like that as well btw)

feersum

& 255 works

Martin Büttner

yeah, but only for mod 256

feersum

Unless Javascript is wrong in some way I cannot even imagine.

Martin Büttner

3:19 PM

it's best if you write your own mod

function mod(x,y) { return ((x%y)+y)%y; } or something like that

Stefnotch

Eh, what is wrong with feersum's method?

Martin Büttner

it doesn't work for numbers that aren't powers of 2

feersum

It will introduce a subtle bug because on leap days 256 is not a power of 2.

Martin Büttner

@feersum as I said, Labyrinth has its own % operator (which of course can be used on any two numbers)

Stefnotch

Ok......

feersum

3:21 PM

What does it do if the modulus is negatiev?

Martin Büttner

having a "proper" modulo is also useful for wrapping around the grid (which you'll need for ><^v)

Stefnotch

So, the % should also use that function?

Martin Büttner

@feersum I assume you meant "modulo", but I'm not sure which number in x % y = z you're referring to.

@Stefnotch yes

VoteToClose

Why do the images not update immediately? :I

feersum

y is the modulus.

Martin Büttner

3:23 PM

@feersum 5 % -3 == -1

@feersum I wasn't aware it's called that, I just know it as "divisor".

basically, the sign of the result should depend on the sign of the divisor, not the dividend

randomra

@Sp3000 :@ or :@@ might worth its own operator if you will have spare ones left

for the vote simulator I have iEhd%2-:@=?0 for 12 bytes

phase

When you find out your code hasn't been working because you never built it.

New Main Posts

0

Q: Three mutual quines

The task In this challenge, your task is to write three programs that form a kind of mutual quine-like system. Let's call the programs A, B and C. If one of the programs is given the source of another program as input, it shall output the source of the third program. For example, if A is given B...

code-golf quine

feersum

3:47 PM

So yesterday I started working on a functional C++ template language

Optimizer

people work on golfing languages here. And here you are..

feersum

The whole program will be run by the C++ compiler.

@Optimizer This is an esolang

I'm hoping to be able to abuse template templates to create lambdas by descending the tree of types and replacing the arguments with their values.

The entire program will be a single typename.

undergroundmonorail

I'm glad brainfuck has a reputation for being way more difficult to use than it actually is so that when I answer easy challenges with it I get rep for free

3

Optimizer

but will it be a golfing esolang?

feersum

It's not going to have 1-letter commands.

Mostly 2 or 3 letters.

Zgarb

3:50 PM

@undergroundmonorail The name is very misleading.

TimmyD

@undergroundmonorail So. Many. Mismatched. Symbols. twitch

undergroundmonorail

i've never thought of it before but i guess it's annoying that < and > and aren't used as brackets so there's no need to make sure they're nested properly and everything

TimmyD

Too much coding in HTML in my formative years, is what I suspect for why I have an issue with it.

trichoplax

I recommend aversion therapy. Write a BF/HTML polyglot

undergroundmonorail

you can tell i've been doing a lot of bf lately because my reaction to that was "bf code that's also valid HTML? How horrifying!!"

rather than the other way around

trichoplax

4:01 PM

@undergroundmonorail I wouldn't worry too much. You haven't taken it too far until English starts to look horrifying

quartata

After this answer was posted, Mego added æ for list mean, and caused î (multiply-by-i) to vectorize, allowing a non-competing 9-byte solution. Seriously is starting to become a seriously good language. — Thomas Kwa 11 hours ago

If only people talked about Rotor like that ;_;

Stefnotch

//Half Life 3 +++ +. --------- --. </body>

^^A brainfuck/HTML/JS polygot!

undergroundmonorail

@trichoplax how horrifying

feersum

@Stefnotch You fell off the tape on the first instruction.

Stefnotch

OH, messed up:
"<body id='>++++++++++[-' >++++++++++ "; var x = "+++++.";
alert(' confirmed!"By A Trustworthy Person');

//Half Life 3 +++ +. --------- --. </body>

undergroundmonorail

4:02 PM

i have used one interpreter in my whole life that lets you fall off the tape

usually it loops or is infinite in both directions

Stefnotch

(This is what I get for not documenting my old code)

Optimizer

You should stop documenting things completely

Stefnotch

@Optimizer To save bytes on my hard disk and to optimize the performance of the PC?

Optimizer

no. for the lulz

Stefnotch

LOL! That is a horrible reason! Think up a good reason so I can convince my teacher! :P

Optimizer

4:09 PM

nothing can convince teachers.

undergroundmonorail

my programming teacher in high school was cool enough to tell us "no one ever actually does this, but it's in the curriculum so do it on your assignments. sorry."

2

Optimizer

well, he lied.

undergroundmonorail

:O

Stefnotch

@Optimizer
Wait, wouldn't that create a paradox because everything a teacher says is true.

Optimizer

that's also a lie

Rainbolt

4:14 PM

My chemistry teacher said that if you eat peanut butter from a spoon, you could get peanut butter in your alveoli and die from suffocation.

Stefnotch

So, statistically speaking, a teacher always lies?

Optimizer

no

from my experience, its you who has been always lying...

sweerpotato

Good evening

Stefnotch

Apples are apples.
And, hi!

sweerpotato

oo, I just thought of a challenge!

flawr

4:22 PM

5

Dennis

/o\

Hahaha.

Rainbolt

@Stefnotch Hello!

Stefnotch

Would a plagiarism challenge be a good idea?
e.g.:
Task: blabla
Twist:
All of your code must come from answers to other challenges, none of it may be written by you. You have to plagiarize at least 10 bytes per plagiarized answer. You may plagiarize as many answers as you want and add them to your program.
(Please provide links to the answers where you got your code from.)

Hi!

Optimizer

too easy

Zgarb

@Stefnotch I think that's been done already, or some variant of it.

Calvin's Hobbies

4:25 PM

Similar has been done

12

Q: Duct tape can fix anything

Overview This challenge was inspired by this StackOverflow Meta post. In it, @hakre says: I've seen a project really written by Stackoverflow (a noob copies together from SO here and SO there), attribution normally never is done which results in rights termination under CC. (sic) Your mis...

Bad Cat Eye

Evening non cats

Stefnotch

Wow, so many things were done already... :D

Optimizer

its not the 19th century ;)

Stefnotch

:D That's true....

Bad Cat Eye

or is it?

Phantom time hypothesis

The phantom time hypothesis is a historical conspiracy theory advanced by German historian and publisher Heribert Illig (born 1947) which proposes that the Anno Domini dating system was fabricated, adding in a period of "phantom time" in the Early Middle Ages, from AD 614 to 911. According to the hypothesis, events dated to this period in Europe and neighbouring regions either occurred in a different period, or did not occur at all. == Explanation of the hypothesisEdit == The hypothesis suggests a conspiracy by the Holy Roman Emperor Otto III, Pope Sylvester II, and possibly the Byzantine Emperor...

Optimizer

4:28 PM

wow

VoteToClose

Grar! My image still hasn't changed.

Calvin's Hobbies

@Stefnotch What you do is have the other answers summed byte count be your byte count, even though it'd be larger than whats plagiarized.

VoteToClose

I changed it two hours ago.

Calvin's Hobbies

Go ask Alex

Bad Cat Eye

Patience my young padawan

TimmyD

4:38 PM

@Calvin'sHobbies "One pill makes you taller, and one pill makes you small ..."

2

Κριτικσι Λίθος

@BadCatEye Since when did you become a Jedi?

Bad Cat Eye

@TimmyD Brilliant XD

@ΚριτικσιΛίθος One does not simply become a Jedi

TimmyD

You are, or you are not. There is no "become."

Calvin's Hobbies

@TimmyD "And the ones that are shaped like 'ಠ' don't do anything at all ..."

Κριτικσι Λίθος

Maybe the force quack with you.

VoteToClose

4:39 PM

Stefnotch

@Calvin'sHobbies What?

undergroundmonorail

@TimmyD oh hey are we talking about the binding of isaac

Kappa

Κριτικσι Λίθος

Lambda

Calvin's Hobbies

@Stefnotch Makes it more interesting than just copying the code. Total score is total byte count in all answers copied from.

Κριτικσι Λίθος

Mu

Nu

VoteToClose

4:41 PM

@undergroundmonorail Dank Depths.

Calvin's Hobbies

@AlexA. Profile update for @VoteToClose with a side of fries

Mmm pi

mew

@Calvin'sHobbies \o/

@trichoplax PhiNotPi

4:42 PM

@Calvin'sHobbies So, I should post that challenge after all? What task would you suggest?

VoteToClose

Yeah. That's better.

trichoplax

@Calvin'sHobbies Your order has arrived :)

VoteToClose

@trichoplax Thanks, breh.

trichoplax

@Optimizer I set that one up by accident :)

Calvin's Hobbies

@trichoplax No fries? Lies!

trichoplax

4:43 PM

:)

profile update with a side of lies

4

TimmyD

@undergroundmonorail I've not played the game. I was referencing "White Rabbit"

Optimizer

@trichoplax you must be a teacher!

trichoplax

no comment...

Um, OK...

VoteToClose

Dark sarcasm... in the classroom... ಠ_ಠ

Calvin's Hobbies

Jefferson Airplane - White Rabbit

►

undergroundmonorail

4:45 PM

@TimmyD I figured it wasn't an actual reference but in the new expansion they added new pills you can take called "One Makes You [Large|Small]" which makes you slightly larger or smaller depending on the name

Calvin's Hobbies

Specifically

VoteToClose

@undergroundmonorail Which is in and of itself a reference.

Calvin's Hobbies

It's all referencing Alice in Wonderland

undergroundmonorail

That makes sense

Bad Cat Eye

@VoteToClose What's this? The laddy reckons himself a poet!

New Main Posts

4:46 PM

-1

Q: Code Billiards (Kolmogorov golf)

You must use one language to write programs that perform the following nine tasks, in any order. Convert an inputted number from base 10 to base 36 Sample input: 1000 Sample output: RS (output must be upper case) Convert each character in a string to its base 10 decimal ASCII codes and print...

code-golf math number kolmogorov-complexity code-billiards

undergroundmonorail

There are a lot of references to a lot of things in BOI

VoteToClose

@BadCatEye Dost thou even hoist?

Calvin's Hobbies

How is "Wonderlang" not an esolang?

VoteToClose

Anybody else hyped about Fallout 4? :D

undergroundmonorail

I'm like indirectly hyped

Bad Cat Eye

4:48 PM

Fallout -15 for me

undergroundmonorail

It's not a series I'm a huge fan of playing myself, but someone who I like to watch play them is starting a Fallout 4 series

Stefnotch

@Calvin'sHobbies http://codegolf.stackexchange.com/questions/tagged/duct-tape-coding?sort=newest&pageSize=15
Looks like there isn't a single code golf question among them..

VoteToClose

I've played every single canon Fallout game.

fangirls

Optimizer

why do you always say fangirls?

and not fanboys?

VoteToClose

@Optimizer ¯\_(ツ)_/¯

Calvin's Hobbies

4:50 PM

@Stefnotch Yes, duct-tape-coding definitely has possibilities. But I'm not here to write challenges for you ;)

VoteToClose