University of Cambridge > Talks.cam > Computational Neuroscience > Computational Neuroscience Journal Club

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Computational Neuroscience Journal Club

Download to your calendar using vCal

If you have a question about this talk, please contact Daniel McNamee .

Hannah Sheahan will cover:

Abstract: In an environment full of potential goals, how does the brain determine which movement to execute? Existing theories posit that the motor system prepares for all potential goals by generating several motor plans in parallel. One major line of evidence for such theories is that presenting two competing goals often results in a movement intermediate between them. These intermediate movements are thought to reflect an unintentional averaging of the competing plans. However, normative theories suggest instead that intermediate movements might actually be deliberate, generated because they improve task performance over a random guessing strategy. To test this hypothesis, we vary the benefit of making an intermediate movement by changing movement speed. We find that participants generate intermediate movements only at (slower) speeds where they measurably improve performance. Our findings support the normative view that the motor system selects only a single, flexible motor plan, optimized for uncertain goals.

This talk is part of the Computational Neuroscience series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hughes Hall Pavilion Room Contact organiser for details Biology and the Arguments of Utility

Other talks

Grand Rounds - Equine Title tbc Proteomics: Expression Analysis and Subcellular Localisation Online Causal Inference Seminar Title to be confirmed Max Perutz Lecture - Title TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity