Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs

Dashboard
Notifications
Mark all as read
Challenges

Tiny Turing-completeness

+0
−1

Your challenge today is to golf a program to interpret something Turing-complete.

You may use any Turing-complete system for this so long as it is not the source language of the challenge - even a Turing-complete subset of the emulated language. You may not directly evaluate code using a builtin within the language. An explanation is not required, but would be nice to have, especially for programs featuring no I/O.

An example program would be this Python program to compute the next step of the input (a string made of 0s and 1s) in Rule 110, created by Redstoneboi:

cells=f'00{input()}0'
print(''.join(['01110110'[int(cells[i:i+3],2)]for i in range(len(cells)-2)]))

This challenge is scored in characters: shortest program wins. Have fun!

Why does this post require moderator attention?
You might want to add some details to your flag.
Why should this post be closed?

1 comment thread

Please use the sandbox. (1 comment)

0 answers

Sign up to answer this question »

This community is part of the Codidact network. We have other communities too — take a look!

You can also join us in chat!

Want to advertise this community? Use our templates!

Like what we're doing? Support us! Donate