In this challenge, Turing machines operate on a zero-initialized binary tape that is infinite in all directions.
You are given an integer \$N\$, where \$1 \le N \le 1000\$. Your program has to output a Turing machine that takes exactly \$N\$ steps to halt, including the final step.
Your program...
Pass The ⚽️ Around The Circle code-golf
The ball game is a game in which a number of players sit together in a circle. Each player is first assigned a number \$ n \$, either 1, 2, or 3. The game begins with any starting player, and proceeds clockwise around the circle. The current player with th...
Zero the byte (eventually) code-golf number-theory integer
Given an infinite arithmetically-progressive¹ sequence, compute the minimum length of a prefix with a product divisible by 2^8.
Spec
The input will always be provided in a way such that it won't take forever to zero the accumulator.
¹...
Is this a half-sort? code-golf string decision-problem
The problem over here introduces an new type of strings: if you split the string into equal halfs and swap the pairs, it produces the same output as sorting the string. We call that a half-sort.
Given a purely ASCII string, check if the str...
Match the entire lyrics of All-Star
The challenge is simple: create a program/function that, when given a string consisting of the entire lyrics to All-Star as they appear in this paste (or not), output whether or not they are, in fact, the entire lyrics. The given string may be off by one of tw...
Reduce the entropy of the input...
Spec
Given two arguments:
A list containing 2 or more positive integers (from 0 to artificial limit of 2^32)
A positive number defining the 'entropy allowance'
Return a sublist containing elements up until the entropy allowance is used up.
For this challe...
Is this a half-sort? code-golf string decision-problem
The problem over here introduces an new type of strings: if you split the string into equal halfs and swap the pairs, it produces the same output as sorting the string. We call that a half-sort.
Given a purely ASCII string, check if the str...
In this challenge, Turing machines operate on a zero-initialized binary tape that is infinite in all directions.
You are given an integer \$N\$, where \$1 \le N \le 1000\$. Your program has to output a Turing machine that takes exactly \$N\$ steps to halt, including the final step.
Your program...
Zero the byte (eventually) code-golf number-theory integer
Given an infinite arithmetically-progressive¹ sequence, compute the minimum length of a prefix with a product divisible by 2^8.
Spec
The input will always be provided in a way such that it won't take forever to zero the accumulator.
¹...
Reduce the entropy of the input...
Spec
Given two arguments:
A list containing 2 or more positive integers (from 0 to artificial limit of 2^32)
A positive number defining the 'entropy allowance'
Return a sublist containing elements up until the entropy allowance is used up.
For this challe...
