Talk:Ternary logic: Difference between revisions
→test case
m (note) |
|||
Line 9:
: It's entirely possible (and probably κῦδος-worthy) to produce a terminating solution of the Halting problem in ternary logic; anything where your code can't definitely figure it out within some reasonable bound on effort becomes a “maybe”. We know we can do this: we can exhibit examples with minimal effort. –[[User:Dkf|Donal Fellows]] 12:45, 8 September 2011 (UTC)
:: Certainly -- the simplest implementation would be code that always returns "maybe". Going deeper would require an implementation which handles expressions in the language being used (which would have greatly varying complexity, depending on the target language). --[[User:Rdm|Rdm]] 12:49, 8 September 2011 (UTC)
==Task structure==
| |||