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
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Post History

40%
+0 −1
Challenges Tiny Turing-completeness

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...

0 answers  ·  posted 2y ago by AndrewTheCodegolfer‭  ·  edited 2y ago by AndrewTheCodegolfer‭

#2: Post edited by user avatar AndrewTheCodegolfer‭ · 2021-11-12T19:06:38Z (over 2 years ago)
  • 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.
  • This challenge is scored in characters: shortest program wins. Have fun!
  • 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:
  • ```python
  • 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!
#1: Initial revision by user avatar AndrewTheCodegolfer‭ · 2021-11-12T18:08:03Z (over 2 years ago)
Tiny Turing-completeness
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.

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