Linked Questions
33 questions linked to/from Fewest (distinct) characters for Turing Completeness
73
votes
155
answers
13k
views
Print X without X (cop's thread)
This is the cop's thread of a cops-and-robbers challenge. You can view the robber's thread here
A pretty common beginner style question is to print some string, but there's a catch! You need to do it ...
- 96.5k
233
votes
28
answers
24k
views
DISARM THE B.O.M.B.!
You have been hired for your tech knowledge as a Secret Agent's sidekick to ensure that the good guy can get his job done and the world can be saved.
This is your last mission before retiring with a ...
- 4,077
95
votes
36
answers
18k
views
Eww, those bytes are gross
Write a program or function that, when given a string, filters out as many distinct bytes as it can and returns the cleaned string. However, since your program hates them, none of these bytes can be ...
- 47.1k
41
votes
68
answers
9k
views
Guess my password (cops' thread)
Inspired by this challenge, which got closed. This is meant to be an easier, but no less interesting version of that.
This is the cops thread of a cops-and-robbers challenge. For the robbers thread, ...
- 287
47
votes
47
answers
4k
views
Replace twos with threes
Given a positive integer n write some code to take its prime factorization and replace all of its factors of 2 with 3.
For ...
- 96.5k
55
votes
36
answers
5k
views
Turing-Complete Language Interpreter
A challenge I thought that would be very cool is to make an interpreter for a Turing-complete language of your choosing.
The rules are simple:
You may use any language to create this interpreter ...
- 707
27
votes
70
answers
3k
views
Quickly! Group together!
As of 27/12/20, the challenge is over as no new answers were posted on the 26th. With an astounding 55 points (and 21 answers), the winner is pppery!
A quick shout out to the top 5 scorers as well:
...
- 49.4k
37
votes
41
answers
4k
views
Print a string in as few distinct characters as possible
The task is simple: print The quick brown fox jumps over the lazy dog using as few distinct characters in your source code as possible.
...
- 2,634
59
votes
19
answers
17k
views
Biggest Irreducible Hello World
Create a program that outputs Hello, World!
The winner is the source code that is the biggest, subject to the constraint that it is irreducible
For this challenge,...
- 2,147
20
votes
60
answers
6k
views
Guess my password (robbers' thread)
Inspired by this challenge, which got closed. This is meant to be an easier, but no less interesting version of that.
This is the robbers thread of a cops-and-robbers challenge. For the cops thread, ...
- 287
42
votes
17
answers
6k
views
Tips for restricted source in Python
Just like code-golf, restricted-source pushes one to exploit quirks and hidden features of the Python language. We already have a place to collect all these tips for code-golf, those for restricted-...
- 96.5k
33
votes
23
answers
9k
views
R.E.P.A.I.R. T.H.E. K.E.Y.B.O.A.R.D
Sequel of this AWESOME challenge
You, a genius tech prodigy detective, have successfully disarmed the bomb and want to break into the computer. The police found the password ...
- 12.3k
27
votes
27
answers
4k
views
Minimal maximum byte for Turing Completeness
Summary
We already have a challenge for the minimal number of characters for Turing completeness. But what about the minimal maximum byte?
Challenge
For a language of your choice, find a subset of ...
- 14.7k
25
votes
32
answers
2k
views
Find a Fixed Point
Given an integer \$x_1\$ and some black box function \$f: ℤ → ℤ\$ find a fixed point of \$f\$ in the sequence defined by \$x_{k+1} := f(x_k)\$.
Details
A value \$x\$ is said to be a fixed point of \$...
- 43.7k
29
votes
31
answers
7k
views
Smallest subset of characters required for Turing Completeness
In Fewest (distinct) characters for Turing Completeness, the goal is to find the minimum number of characters which make a language Turing Complete...in other words, allow it to do any computation ...
- 18.6k