<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:16:13Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/33956" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/33956</identifier><datestamp>2026-05-14T13:54:09Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Novikoff, Timothy</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Strogatz, Steven H</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Rand, Richard Herbert</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Kleinberg, Jon M</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-09-05T15:26:34Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-01-29T07:00:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2013-01-28</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/33956</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">8267668</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In order to build toward an algorithmic theory of education we construct simple, idealized mathematical models of students, learning, educational software and educational software usage data. The models are created by taking concepts from the psychology literature and commercial educational software, stripping them down to bare mathematical essentials, and then rigorously analyzing these models. We consider the spacing effect from the psychology literature and model the notion of spaced repetition as simple constraints on mathematical sequences. Though the constraints are simply stated - that each occurrence of any element in the sequence fall within a given interval of possible distances beyond the previous occurrence - the mathematical problems that arise from these constraints are subtle. We present novel mathematical techniques suited to these problems. We also consider educational software usage data, and consider the task of measuring the amount of educational content a student must have mastered at any given time given that they produced some specific usage data. We find that once properly defined, the task is again subtle and requires carefully constructed algorithms, which in turn require careful mathematical analysis. Finally we consider the notion that it is easier for students to learn new concepts that are related to already-familiar concepts, and we present a novel network optimization problem inspired by this notion.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">education</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Algorithmic Education Theory</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Applied Mathematics</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor" lang="en_US">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Applied Mathematics</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author" lang="en_US">Novikoff, Timothy</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="cf9bebc9-e00a-49a7-9d16-6c55c41484b9">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Algorithmic Education Theory&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2013-01-28&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Novikoff, Timothy&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>algorithms&lt;/Keyword>
    &lt;Keyword>education&lt;/Keyword>
   	&lt;Abstract>In order to build toward an algorithmic theory of education we construct simple, idealized mathematical models of students, learning, educational software and educational software usage data. The models are created by taking concepts from the psychology literature and commercial educational software, stripping them down to bare mathematical essentials, and then rigorously analyzing these models. We consider the spacing effect from the psychology literature and model the notion of spaced repetition as simple constraints on mathematical sequences. Though the constraints are simply stated - that each occurrence of any element in the sequence fall within a given interval of possible distances beyond the previous occurrence - the mathematical problems that arise from these constraints are subtle. We present novel mathematical techniques suited to these problems. We also consider educational software usage data, and consider the task of measuring the amount of educational content a student must have mastered at any given time given that they produced some specific usage data. We find that once properly defined, the task is again subtle and requires carefully constructed algorithms, which in turn require careful mathematical analysis. Finally we consider the notion that it is easier for students to learn new concepts that are related to already-familiar concepts, and we present a novel network optimization problem inspired by this notion.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>