Computational metacognition represents a cognitive systems perspective on high-order reasoning in integrated artificial systems that seeks to leverage ideas from human metacognition and from metareasoning approaches in artificial intelligence. The key characteristic is to declaratively represent and then monitor traces of cognitive activity in an intelligent system in order to manage the performance of cognition itself. Improvements in cognition then lead to improvements in behavior and thus performance. We illustrate these concepts with an agent implementation in a cognitive architecture called MIDCA and show the value of metacognition in problem-solving. The results illustrate how computational metacognition improves performance by changing cognition through meta-level goal operations and learning.
more »
« less
Kills, Deaths, and (Computational) Assists: Identifying Opportunities for Computational Support in Esport Learning
- Award ID(s):
- 1917855
- PAR ID:
- 10482140
- Publisher / Repository:
- ACM
- Date Published:
- ISBN:
- 9781450391573
- Page Range / eLocation ID:
- 1 to 13
- Format(s):
- Medium: X
- Location:
- New Orleans LA USA
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Careers in science, technology, engineering, and mathematics (STEM) increasingly rely on computational thinking (CT) to explore scientific processes and apply scientific knowledge to the solution of real-world problems. Integrating CT with science and engineering also helps broaden participation in computing for students who otherwise would not have access to CT learning. Using a set of emergent design guidelines for scaffolding integrated STEM and CT curricular experiences, we designed the Water Runoff Challenge (WRC) - a three-week unit that integrates Earth science, engineering, and CT. We implemented the WRC with 99 sixth grade students and analyzed students’ learning artifacts and pre/post assessments to characterize students’ learning process in the WRC. We use a vignette to illustrate how anchoring CT tasks to STEM contexts supported CT learning for a student with low prior CT proficiency.more » « less
-
A<sc>bstract</sc> We present an efficient algorithm for computing the prepotential in compactifications of type II string theory on mirror pairs of Calabi-Yau threefolds in toric varieties. Applying this method, we exhibit the first systematic computation of genus-zero Gopakumar-Vafa invariants in compact threefolds with many moduli, including examples with up to 491 vector multiplets.more » « less
An official website of the United States government
