MétaCan
Menu
Back to cohort
Record W4205700957 · doi:10.22215/etd/2021-14677

Modelling Programming Problem Solving in Python ACT-R

2021· dissertation· en· W4205700957 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldComputer Science
TopicTeaching and Learning Programming
Canadian institutionsCarleton University
Fundersnot available
KeywordsPython (programming language)Computer scienceProgramming languageCognitive modelSoftware engineeringThink aloud protocolProgramming paradigmArtificial intelligenceCognitionHuman–computer interactionUsabilityPsychology

Abstract

fetched live from OpenAlex

Cognitive architectures such a Python ACT-R have been used to model human problemsolving strategies and behaviours in complex domains such as programming. However, to date, models of programming have not investigated various strategies for generating programs. To address this, the present thesis describes the construction of five cognitive models that represented different novice and expert strategies for solving a programming problem in Python. To aid in the design of the models, I conducted a talk-aloud study with expert and novice programmers. The models use a set of goals and steps that were identified in the study transcripts and solutions produced by the programmers in the study. Expert and competent novices were best modelled by the model utilizing an SGOMS framework. The SGOMS framework incorporated the ability to formalize the relationships between goals of the problem and allowed the model to structure the solution in the same way as experts and competent novices.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.946
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.021
GPT teacher head0.272
Teacher spread0.251 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations1
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicTeaching and Learning ProgrammingFrench-language works237,207