Given two strings as input, return the result of XORing the code-points of one string against the code points of the other.
For each character in the first input string, take the code-point (e.g. for A, this is 65) and XOR the value against the corresponding index in the second string and output ...
Robbers thread
Cops,
Choose two strings of code, one public and one secret. We will call them P and S. You will be writing a program using only repetitions of these strings.
For example: if you choose P=helloand S=world, valid programs would be hello, world, helloworld, worldhello, helloworldworl...
We've got various answers strewn across meta that tell different stories:
On the standard loopholes, we disallow answers that aren't programming languages. This appears to be the most definitive answer of the lot. It has a vote count of 16/-8.
However, on a question that asks "Should answers ...
Challenge Statement
The goal of this challenge is to build the 5 state Infinite Time Turing machine that takes the longest to halt.
The rest of this challenge is some definitions and an example to help you.
Turing Machines
For clarity we will define the Turing machines as used for this problem. ...
How would you create a function in javascript that returns a random number between 0-5000, but in any calls to this function, it cannot return a number that was already returned in a previous call.
After 5000 calls, it would return null or false (as there will be no numbers left that were not pre...
Slice the source code
cops-and-robbers
Cops
First, to understand slices, see here.
Cops, your job is write to a program, that when sliced, will input a string and reverse it. The slice could be something like [::-1][2::6] which means "reverse the code, then get each sixth char starting from index 2.
Is this a hamiltonian cycle?
path-findinggrid
There is a 3x3 square block made of 1x1 square blocks, with coins in each 1x1 block, starting from top left block you want to collect all the coins and return to top left block again, if possible provide instructions to achieve this.
Rules
From block...
Challenge Statement
The goal of this challenge is to build the 5 state Infinite Time Turing Machine that takes the longest to halt. Since Infinite Time Turing Machines can run for infinite time your score will be a "transfinite ordinal".
That's the challenge statement, but if you don't what all ...
