I've invented a new language called FunKiller, which is designed to make radiation-hardening challenges trivial and boring. This is the JavaScript interpreter: function interpret(s) { var lines = s.split("\n"); var max = 0; var longestLine = "" lines.forEach(function(l) { if (l.length >

Here are some example code-golf submissions using Wolfram|Alpha: Valentine's golf! I heart you! Largest number in ten bytes of code I have two main questions about the use of Wolfram|Alpha: Is the use of the Internet problematic? What is considered the output? The Internet connectivity con...

Visualize the Euclidean algorithm The Euclidean algorithm is a widely known algorithm for calculating the greatest common divisor (GCD) of two natural numbers. The algorithm For the purpose of this challenge, the algorithm is described as below: Display the two input as adjacent lines of a c...

If you take any image and scale it down to a 6x6 image and then convert it to a B/W image you have generated a thumbprint of sorts for your image. (Demo image below) There are 2^(6*6) or 68.7 Billion combinations of thumb-prints. According to a 2014 study, over 1.8 Billion photos are uploaded ...

The first lambda calculus notation is the standard, human readable one: \f.(\x.xx)(\x.f(xx)) The second lambda calculus notation is the compact notation. The compact notation omits the . after the variable and uses ` for application (like Unlambda): \f`\x`xx\x`f`xx Your task is to write a p...

Recursive string substitution The task Write a program or function that given three strings A, B, C produces an output string where each instance of B in A has been recursively substituted with C. Recursively substituting means repeatedly replacing all non-overlapping instances of B in A until ...

Some title Note: Please do not upvote until/unless you think the specs are ready. Please downvote only if you think this can't be done under the current community rules. Please leave a comment if you've seen it even if you don't have anything specific to add (then I know it's been looked at at l...

Let's play a word chain! answer-chainingkolmogorov-complexity A word chain is a fun game. You simply "chain" the words as the name implies. This is how this works. already everyone knows that Ca[t] -> [T]a[p] -> [P]ac[k] -> [K]nee[l] -> [L]eprechau[n] -> etc.. The first player chooses what w...

Fractal Rorschach Sequence code-golfsequencecombinatoricssubsequencebase-conversion Let's define a function f(N) on the integers. We'll use N = 38 as an example: Get the binary representation of N: [1,0,0,1,1,0]. Take all subsequences of this list. These don't need to be contiguous, so [1,1,1...

Inspired by this challenge Goal: The goal is to draw waves crashing onto a beach. Input: You will be given 3 integers greater than 0 (in whatever format you want) as input. The first integer will be the length of the drawing The second integer will be the index of the sandbar, where the w...