Wolfram Data Repository
Immediate Computable Access to Curated Contributed Data
S combinator expressions of leaf counts 1 through 13 that do not terminate after 10,000 evolution steps
Get the list of non-terminating S combinator expressions of leaf count 7:
In[1]:= | ![]() |
Out[1]= | ![]() |
Get the length of the list of non-terminating S combinator expressions of leaf count 13:
In[2]:= | ![]() |
Out[2]= | ![]() |
Perform from scratch the enumeration of S combinator expressions of leaf count n that do not terminate in max steps. This method can be used to extend the dataset; however, note that as the leaf count for the combinator expressions and maximum steps for the evolutions increase, this computation will become increasingly expensive:
In[3]:= | ![]() |
Enumerate S combinator expressions of leaf count 8 that do not terminate within 10 steps:
In[4]:= | ![]() |
Out[4]= | ![]() |
Group S combinator expressions of leaf count 7 that terminate within 10,000 steps in equivalence groups designated by their fixed point form:
In[5]:= | ![]() |
In[6]:= | ![]() |
Out[6]= | ![]() |
Find the distribution of fixed point leaf counts for S combinator expressions of leaf count 7 that terminate within 10,000 steps:
In[7]:= | ![]() |
Out[7]= | ![]() |
In[8]:= | ![]() |
Out[8]= | ![]() |
Wolfram Research, "Extensively Evolving Combinator Expressions" from the Wolfram Data Repository (2021)