Talk:Determine if a string is collapsible: Difference between revisions
Talk:Determine if a string is collapsible (view source)
Revision as of 14:04, 9 June 2020
, 3 years ago→What does determine mean?
Line 65:
:::: Or perhaps by 'inferred' you actually meant 'implied' ?
:::: (There generally seems to be bit of slippage between language and intention here. But no matter – the pruning of repeated characters, even if unaccountably mislabelled as the detection of repeated characters, is not an obscure or subtle exercise). [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 21:27, 8 June 2020 (UTC)
::: Gerard Schildberger, I believe (from what I read of your remarks) that you are being deliberately obtuse. The null string is only non-collapsible by axiom. Are you saying that there is a function that can determine if a sting is collapsible faster than trying to collapse it? Looking at the Rexx solution where does it first perform that test? Looking at the Rexx output where has it determined if the string was collapsed, even for the null special case? Why would an non-colapable by the rules rather than axiom example not be an improvement? I think that the title is misleading, and worse the text specification is nonsense--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:04, 9 June 2020 (UTC)
| |||