3 ms·

The S Combinator Challenge

• bediger4000 5y ago
  If this challenge interests you, you might be interested in: "The Combinator S" by Johannes Waldemann https://core.ac.uk/download/pdf/82822105.pdf https://core.ac.uk/download/pdf/82822105.pdf That PDF looks like a trimmed-down version of Waldemann's doctoral dissertation of the same name, which had a lot of interesting terms composed of all-S-combinators. Another of Waldemann's papers: https://www.semanticscholar.org/paper/Normalization-of-S-Terms-is-Decidable-Waldmann/29a1ec216be661ac2fa62cb3ec4ba400d76be2f8 https://www.semanticscholar.org/paper/Normalization-of-S-Ter... Seems like if S-terms are decideable, Wolfram's challenge would be met in the negative.
• deleted 5y ago
  [deleted]
• deleted 5y ago
  [deleted]