Abstract

Previous studies have found that inhibiting a task set plays an important role in task switching. However, the impact of stimulus–response (S–R) complexity on this inhibition processing has not been explored. In this study, we applied the backward inhibition paradigm (switching between tasks A, B, and C, presented in sets of three) in order to investigate inhibition performance under different S–R complexities caused by corresponding S–R mappings. The results showed that the difficult condition resulted in a greater switch cost than the moderate and easy conditions. Furthermore, we found a significant n−2 repetition cost under the easy S–R complexity that was reversed under the difficult S–R complexity. To verify stability of the reversed n−2 repetition cost in the difficult condition, we recruited another independent sample to conduct an additional experiment with the difficult condition. These results replicated the reversed n−2 repetition cost. These findings suggest that S–R complexity affects task-set inhibition in task switching because the effect of the task-set inhibition was insignificant when the S–R complexity increased; it was only significant under the easy condition. This result was caused by the different cognitive resource assignments.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.