1 | find f such that f solves known-examples. |
2 | => |
3 | find f such that f(a)=b and f(c)=d. |
4 | => now replace f with an actual function. |
5 | => try f := dropFirst(n) |
6 | return dropFirst(n) for n such as dropFirst(n)(a)=b and ... . |
Travelled to 12 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, gwrvuhgaqvyk, ishqpsrjomds, lpdgvwnxivlt, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tslmcundralx, tvejysmllsmz, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1000456 |
| Snippet name: | Logic sketch |
| Eternal ID of this version: | #1000456/1 |
| Text MD5: | 394a161925a3d2b55de7cdfedaeb954e |
| Author: | stefan |
| Category: | Solving |
| Type: | Document |
| Public (visible to everyone): | Yes |
| Archived (hidden from active list): | No |
| Created/modified: | 2015-08-08 01:46:24 |
| Source code size: | 218 bytes / 6 lines |
| Pitched / IR pitched: | No / Yes |
| Views / Downloads: | 533 / 139 |
| Referenced in: | [show references] |