{"title":"将自然语言文本编译成教学机程序","authors":"L. Uhr","doi":"10.1145/1464052.1464056","DOIUrl":null,"url":null,"abstract":"Programmed instruction, via digital computers, must be made as painless as possible, both in the writing and the changing of programs, for the author of the programmed text. Otherwise we will only slowly accumulate a body of expensive programs that we will never succeed in testing adequately. It is crucial, given that we are investigating programmed instruction at all, that it become easy to write and rewrite the programs.","PeriodicalId":126790,"journal":{"name":"AFIPS '64 (Fall, part I)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"The compilation of natural language text into teaching machine programs\",\"authors\":\"L. Uhr\",\"doi\":\"10.1145/1464052.1464056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Programmed instruction, via digital computers, must be made as painless as possible, both in the writing and the changing of programs, for the author of the programmed text. Otherwise we will only slowly accumulate a body of expensive programs that we will never succeed in testing adequately. It is crucial, given that we are investigating programmed instruction at all, that it become easy to write and rewrite the programs.\",\"PeriodicalId\":126790,\"journal\":{\"name\":\"AFIPS '64 (Fall, part I)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1899-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFIPS '64 (Fall, part I)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1464052.1464056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '64 (Fall, part I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1464052.1464056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The compilation of natural language text into teaching machine programs
Programmed instruction, via digital computers, must be made as painless as possible, both in the writing and the changing of programs, for the author of the programmed text. Otherwise we will only slowly accumulate a body of expensive programs that we will never succeed in testing adequately. It is crucial, given that we are investigating programmed instruction at all, that it become easy to write and rewrite the programs.