S combinator expressions of leaf counts 1 through 10 that do not halt
Details
The data is calculated by enumerating S combinator expressions of a certain leaf count using EnumerateCombinators and then applying SCombinatorHaltsQ to check if each expression's evolution will terminate.
The default content is a Dataset where the rows are labeled by the leaf count of the S combinator expression and contain the combinator expressions that do not terminate.
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 10:
In[2]:=
Out[2]=
Scope & Additional Elements
The function SNT can be used to extend the dataset; however, note that as the leaf count for the combinator expressions increases, this computation will become increasingly more time-expensive:
In[3]:=
Return the time required to calculate non-terminating S combinator expressions of leaf count 11:
In[4]:=
Out[4]=
Group terminating S combinator expressions of leaf count 7 in equivalence groups designated by their fixed point form:
In[5]:=
In[6]:=
Out[6]=
Find the distribution of fixed point leaf counts for terminating S combinator expressions of leaf count 7: