2 ms·
I see that piece mentioned a lot, but I don't think it's really in keeping with the existing philosophy or research on computational creativity. There's a lot o
by _delirium 16y ago
I see that piece mentioned a lot, but I don't think it's really in keeping with the existing philosophy or research on computational creativity. There's a lot of disagreement of course, but a vague consensus is that the formalization problem is harder than the computational complexity problem: computers composing novel, good symphonies is not mainly bottlenecked by computational complexity, but because we don't know how to write a program to do it (in any running time).
Put differently, why is symphony composition harder than SAT? You can download programs right now to solve huge classes of SAT, but not to compose huge classes of symphonies (David Cope's interesting work notwithstanding).
(That example from: http://www.kmjn.org/notes/nphard_not_always_hard.html http://www.kmjn.org/notes/nphard_not_always_hard.html)
- bdhe 16y agoThat's an interesting read! I think his point is that NP-completeness does not give you an intuition about the hardness of automating creativity. That point is granted. However, if P were equal to NP, then it would imply that we can write algorithms that can automate creativity (Levin's algorithm is an algorithm to solve all NP-complete problems in polynomial time, if P=NP); which will raise an interesting philosophical debate all on its own.