Linked Questions

Ask Question
11 questions linked to/from Build a Turing *incomplete* language
Hot Newest Score Active Unanswered
341 votes
184 answers
155k views

What general tips do you have for golfing in Python? I'm looking for ideas which can be applied to code-golf problems and which are also at least somewhat specific to Python (e.g. "remove comments" is ...
moinudin's user avatar
  • 13k
156 votes
89 answers
27k views

Summary: For any given language, what is the smallest amount of unique characters for your language to be Turing-Complete? Challenge: For any language of your choice, find the smallest subset of ...
Julian Lachniet's user avatar
  • 3,779
58 votes
39 answers
7k views

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 even ...
arodebaugh's user avatar
  • 747
101 votes
10 answers
6k views

Determining whether a Language is Turing Complete is very important when designing a language. It is a also a pretty difficult task for a lot of esoteric programming languages to begin with, but lets ...
Wheat Wizard's user avatar
  • 103k
35 votes
7 answers
4k views

Write a formula using only the digits 0-9, +, *, -, <...
prime_directive's user avatar
  • 351
33 votes
3 answers
3k views

Notice: I'm willing to give a bounty to any answer that I find interesting. Your challenge is to design a Turing-complete one instruction set computer (OISC): An OISC is an abstract machine that ...
MD XF's user avatar
  • 14.3k
38 votes
3 answers
6k views

Your goal is to determine whether a given number n is prime in the fewest bytes. But, your code must be a single Python 2 expression on numbers consisting of only ...
xnor's user avatar
  • 150k
17 votes
11 answers
2k views

Natural numbers ≡ \$\mathbb{N}≡\{0,1,2,...\}\$ The submission can be either a program or a function, both cases will henceforth be referred to as "function". The task is to golf the shortest ...
user41805's user avatar
  • 13.4k
12 votes
9 answers
952 views

This is the cops' thread. See the robbers' thread here. In this cops and robbers challenge, the cops will be tasked with writing an algorithm that computes some function of their choice, while the ...
dingledooper's user avatar
  • 23.4k
15 votes
1 answer
1k views

This is a cops-and-robbers challenge based around defining languages and proving they are Turing complete. This is the cops' thread. The robbers' thread is here. Cops As a cop, you will prepare two ...
N. Virgo's user avatar
  • 7,446
3 votes
3 answers
1k views

I'm currently working with a branchless language which does not have native Less-Than, Greater-Than or Equal-To functions. I do however have min, ...
Eliseo D'Annunzio's user avatar
  • 7,619