|
No, most are theorems, for which they want a proof one way or another.
I think that they are possible, it's just that people aren't dedicated enough to work hard and find a solution. For example, the P vs. NP looks (to one of the uninitiated) like it is quite possible for the group on this website, considering how many computer science experts there are here.
In general, people involved in robotics have at least some math skill, so I don't see why we couldn't try, at least.
__________________
2004:
SVR Imagery Award
SVR Semifinalists with 473 and 687
RIP Andrew Dang
3/22/2004
|