All your base are belong to us 6 * 9 = 42
When Douglas Adams wrote THHGTTG, he just made up a formula for the answer to Life, the Universe and Everything. And then some spoilsport pointed out that it was a valid formula... when interpreted in base 13.
Given an input formula, please output as ma...
In computability theory, Rice's theorem states that all non-trivial, semantic properties of programs are undecidable. A semantic property is one about the program's behavior (for instance, does the program terminate for all inputs), unlike a syntactic property (for instance, does the program contain an if-then-else statement). A property is non-trivial if it is neither true for every program, nor for no program.
Rice's theorem can also be put in terms of functions: for any non-trivial property of partial functions, no general and effective method can decide whether an algorithm computes a partial...
1751
Code-Bowling
You've been hired by Brunswick Bowling to create a simple program to output the text Code Bowling on their monitors. This company is worth a pretty penny and you feel you can swindle them for quite the bit of cash.
The job description clearly states that they pay on a scoring basi...
3
In this challenge, you receive a string as input containing a string of X's, Y's and Z's eg. "XYZZ". X, Y and Z represent a particular character. This pattern is then compared with a second string input. If the pattern exists as a substring in the second input, return True, otherwise, return Fals...
Anonymous
Write a program that takes N numbers as input and prints all 3^(N-1) equations that can be formed by inserting the operators +, -, or * between these numbers (keeping them in the initial order). Also count how many unique answers there are and print that as well.
So far, I have this code:
impo...
Unary-binary trees
A unary-binary tree is a tree with nodes of three types: terminal nodes, which have no children; unary nodes, which have one child each; and binary nodes, which have two children each. We can represent them with the following grammar, given in BNF:
<e> ::=
<terminal> ...
...and real golf for my code friends.
This is a challenge based on a one year old XKCD comic which consists mostly of toasts (parodies of the first in the comic) following a distinct pattern, but with some slight variation.
Your task is to write a program (or function) that takes the first ...
