|
|
Post by alex markwart on Nov 9, 2006 12:45:55 GMT 10
See you all there, including Joel and PV. Excellent.
|
|
|
|
Post by AlexPV on Nov 9, 2006 13:59:37 GMT 10
There is a standard Haskell function elem which checks whether a given value appears in
a list:
elem x [] = False -- e1
elem x (y:ys)
| x == y = True -- e2
| otherwise = elem x ys -- e3
Another standard Haskell function, defined as follows, deletes all occurrences of a given
value from a list:
delete x [] = [] -- d1
delete x (y:ys)
| x == y = delete x ys -- d2
| otherwise = y: delete x ys -- d3
Naturally, we would expect that if we delete a value from a list, it no longer appears in
the list. That is, for all lists ys, and values x, with appropriate general types,
elem x (delete x ys) = False
Prove this property by structural induction.
I dont think ill be riding this arvo.
|
|
|
|
Post by AlexPV on Nov 9, 2006 14:15:47 GMT 10
ps any one got pics of nick bs helmet handy?
|
|
|
|
Post by alex markwart on Nov 9, 2006 14:22:41 GMT 10
Hmmm, I don't think so, certainly none that are on the internet thanks to the hosting issues erasing everything. I don't even think I have any on the home computer. Do you want me to take some new ones?
P.S. I wish I was doing what you are doing, looks like maths on a computer!
Are you a pretty good programmer now? It looks like that must all be contributing to programming skills, but I have no idea.
|
|
|
|
Post by tomac on Nov 9, 2006 23:11:51 GMT 10
"Investigated the TMS timings at v1 and v5 that resulted in motion impairment
- V1 (50ms post stimulus) v5 (70ms) or v1 (90ms)
- stimulation of any one of these areas at those times impaired motion
- shows the importance of feedback projections to v1 for (motion) perception"
Does anyone understand that? I don't. No ride for me.
- Joel
|
|
