Talk:Optimal ET sequence: Difference between revisions
Cmloegcmluin (talk | contribs) →Sorted by complexity?: new section |
Cmloegcmluin (talk | contribs) →Can ETs with non-uniform maps ever be optimal?: new section |
||
| Line 33: | Line 33: | ||
I think that almost always (perhaps simply always) this error-decreasing constraint results in a list whose member ETs are sorted by increasing complexity. I would be interested to see if this is true, and if so, note it in the article. Does anyone have an idea how to prove this one way or the other? --[[User:Cmloegcmluin|Cmloegcmluin]] ([[User talk:Cmloegcmluin|talk]]) 19:12, 4 May 2023 (UTC) | I think that almost always (perhaps simply always) this error-decreasing constraint results in a list whose member ETs are sorted by increasing complexity. I would be interested to see if this is true, and if so, note it in the article. Does anyone have an idea how to prove this one way or the other? --[[User:Cmloegcmluin|Cmloegcmluin]] ([[User talk:Cmloegcmluin|talk]]) 19:12, 4 May 2023 (UTC) | ||
== Can ETs with non-uniform maps ever be optimal? == | |||
On another discussion thread on this page, the question arose as to whether an ET with a non-uniform map could ever make it into an optimal ET sequence. I wanted to set this question aside on its own topic for further discussion. I agree with Fredg999 and Dave that it is an interesting question, but at this time, I don't have any particular ideas on how to answer it. --[[User:Cmloegcmluin|Cmloegcmluin]] ([[User talk:Cmloegcmluin|talk]]) 19:14, 4 May 2023 (UTC) | |||