Talk:Brady's algorithm: Difference between revisions
Jump to navigation
Jump to search
(Created page with "Hey C7X, what do you think about merging this into the main Tree Normal Form article? My thought is that we could migrate any new content over from here and then turn this into a redirect. IIUC, "Brady's algorithm" is just an alternative name coined by Nick Drozd to describe TNF enumeration. Does that sound right? ~~~~") |
No edit summary |
||
Line 1: | Line 1: | ||
Hey C7X, what do you think about merging this into the main [[Tree Normal Form]] article? My thought is that we could migrate any new content over from here and then turn this into a redirect. IIUC, "Brady's algorithm" is just an alternative name coined by Nick Drozd to describe TNF enumeration. Does that sound right? [[User:Sligocki|Sligocki]] ([[User talk:Sligocki|talk]]) 15:34, 15 November 2024 (UTC) | Hey C7X, what do you think about merging this into the main [[Tree Normal Form]] article? My thought is that we could migrate any new content over from here and then turn this into a redirect. IIUC, "Brady's algorithm" is just an alternative name coined by Nick Drozd to describe TNF enumeration. Does that sound right? [[User:Sligocki|Sligocki]] ([[User talk:Sligocki|talk]]) 15:34, 15 November 2024 (UTC) | ||
: Sounds good! (Shortly after making this page I found that [[Tree Normal Form]] describes a similar algorithm, but I figured that it was probably fine since the algorithm currently listed there is for enumeration of all TMs, while this one sifts through them with deciders. But this isn't too much of a difference, and if you think they are too similar you can merge them.) [[User:C7X|C7X]] ([[User talk:C7X|talk]]) 22:08, 15 November 2024 (UTC) |
Latest revision as of 22:08, 15 November 2024
Hey C7X, what do you think about merging this into the main Tree Normal Form article? My thought is that we could migrate any new content over from here and then turn this into a redirect. IIUC, "Brady's algorithm" is just an alternative name coined by Nick Drozd to describe TNF enumeration. Does that sound right? Sligocki (talk) 15:34, 15 November 2024 (UTC)
- Sounds good! (Shortly after making this page I found that Tree Normal Form describes a similar algorithm, but I figured that it was probably fine since the algorithm currently listed there is for enumeration of all TMs, while this one sifts through them with deciders. But this isn't too much of a difference, and if you think they are too similar you can merge them.) C7X (talk) 22:08, 15 November 2024 (UTC)