Changes between Initial Version and Version 1 of Ticket #2472, comment 28
- Timestamp:
- 11/19/15 10:41:02 (9 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Ticket #2472, comment 28
initial v1 11 11 > * Couldn't the solution be transformed to a standard data analysis tree (simplify, optimize? 12 12 13 Might be fixed in the future (-> separate tickets )13 Might be fixed in the future (-> separate tickets #2515, #2517) 14 14 15 15 > * Why are the boolean problems restricted (number of bits) and why is this done in the evaluation function? … … 18 18 In the case of the even-parity problem the restriction stems from the fact that only digits are used as terminal symbols and there are only 10 digits. Would be easy to extend this. 19 19 20 In the case of the mux-problem I don't remember the exact reason but I believe this is an artifact from an earlier implementation where only digits and characters were used as terminal symbols. In any case the limit of 37 bits input is rather large and would mean that a single evaluation would have to iterate over 2^37^ different input cases... I'm going to create a ticket for this .20 In the case of the mux-problem I don't remember the exact reason but I believe this is an artifact from an earlier implementation where only digits and characters were used as terminal symbols. In any case the limit of 37 bits input is rather large and would mean that a single evaluation would have to iterate over 2^37^ different input cases... I'm going to create a ticket for this (#2516). 21 21 22 22 >