Posts by AndrewTheCodegolfer
Empty answers to questions requiring an interpreter In particular, "simulating" a machine on this very machine by accepting the initial state as the simulation's initial state and returning t...
COPS THREAD A famous cops-and-robbers challenge whose source shall remain unnamed is brought to Codidact. You are a robber. Your goal is to find answers on this link which haven't been cracked an...
Turing machines may use the contents of their tape pre-execution as their input
Mathematica, 4 bytes OddQ Not at all my code - this is the original post by Martin Ender. Prints True for odd inputs and False for even inputs.
///, 13 bytes Hello, World! Someone had to. 18 bytes using replacement /x/H/xello, World! 23 bytes using two-layer replacement /a/Hello, World!//b/a/b a is replaced with Hello, World! ...
Bypassing source restrictions by storing data in the file name In some languages, like Pxem, programs are usually stored in the file name and the file's contents are irrelevant. On Somewhere Else,...
My thoughts on the matter Does randomness need to be uniform? Nope, although it has to follow the specifications of the challenge (but if the challenge is too demanding with its randomness yo...
Platform specific languages are free if there is a free implementation on another platform (or of the platform which the lang is native to) Although Batch is exclusive to Windows, Windows can be p...
h, 4 bytes 1,-1 Neither this program (by VilgotanL) nor the language (by Nerdaxe) are mine, but I think the latter is interesting and so I am submitting the former. Step-by-step guide: Accumu...
Image output may be a pixel shader A pixel shader inputs x,y coordinates of a pixel and prints the color of a pixel (scalar for grayscale, tuple for full color, bool for binary...). Relevant for S...
Functions may return bools via the presence/absence of an error Crashing to mean false and not crashing to return true. Another branch of the exit code answer.
Programs/functions may use the presence/absence of output as a bool
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...
- ← Previous
- 1
- 2
- Next →
