I would have thought you tried the following if you already have a string *** and wanted to check how much you can overlap ab (which does not depend on the orientation of ***):
*** ***
ab ba
*** ***
ab ba
*** ***
ab ba
*** ***
ab ba
*** ***
ab ba
@PhiNotPi "You are also allowed to create a language to test, as long as you can show why it is Turing-complete." That's a bit dodgy. I could define a new language that is a string substitution of BF, where each character is replaced by the CJam code interpreting that character.
(Also, the optimal subset for BF only needs either - or +)
@Sparr it's not even like TI-BASIC... it's like python... unless you define new variables you can't just put any string in your code without getting errors
that still means I can change the language's syntax to match the string representation of my code's internal representation of the program though, right?
subleq OISC in Python, 317 269 bytes
import collections
g=0
P={}
while 1:
P[g]=[[0],collections.defaultdict(int,enumerate(list(int(x)for x in reversed(str(g)))))]
g+=1
for o,[a,p]in P.items():
i=a[0]
p[i+p[i+1]]-=p[i+p[i]]
if p[i+p[i+1]]<=0:a[0]+=p[i+2]
...
@Sp3000 I'm not going to use from collections import * for the stupid reason that I don't want to figure out how to tell the pylint plugin for my editor to ignore the unused import warnings
Entropy Golf
This is a scoring system without a challenge.
My idea is to score entries based on the total Shannon entropy contained within them. This provides an incentive to both use fewer unique characters and to have a shorter program overall.
Given a string of characters, the score is c...
<!Doctype html>
<html>
<head>
</head>
<body>
<p><b>Challenge!</b></p>
</body>
</html>
Take this simple page above and make it as comlicated/hard to read as possible without changing the output.
Rules:
The output has to look like the page above
It must be written in a browser based langua...
I don't think we're in danger like Beer.SE. I joined that close to its debut in public beta. I haven't visited in quite a while and as I understand it's become something of a ghost town.
subleq OISC in Python, 317 269 bytes
import collections
g=0
P={}
while 1:
P[g]=[[0],collections.defaultdict(int,enumerate(list(int(x)for x in reversed(str(g)))))]
g+=1
for o,[a,p]in P.items():
i=a[0]
p[i+p[i+1]]-=p[i+p[i]]
if p[i+p[i+1]]<=0:a[0]+=p[i+2]
...
Entropy Golf
This is a scoring system without a challenge.
My idea is to score entries based on the total Shannon entropy contained within them. This provides an incentive to both use fewer unique characters and to have a shorter program overall.
Given a string of characters, the score is c...
<!Doctype html>
<html>
<head>
</head>
<body>
<p><b>Challenge!</b></p>
</body>
</html>
Take this simple page above and make it as comlicated/hard to read as possible without changing the output.
Rules:
The output has to look like the page above
It must be written in a browser based langua...
