@cliffordheath@mastodon.social
Post #2324830
2026-04-15 23:54 UTC
@divbyzero@mathstodon.xyz And if you use breadth-first traversal it's also possible to recognise common subexpressions, I think
Replies (2)
-
@cliffordheath@mastodon.social 2026-04-16 00:02
@divbyzero@mathstodon.xyz Does this re-establish or even extend the formalism that Russell and Whitehead sought?
-
@cliffordheath@mastodon.social 2026-04-17 06:24
@divbyzero@mathstodon.xyz agghhhh phooey. It doesn't produce minimal forms, and without additional substitutions (not yet all known) cannot be automatically minimised. So two common subexpressions might not match. The bitstring representation is still valuable however.