{"title":"软件和硬件实现算法分析","authors":"D. Ostapko","doi":"10.1145/1408800.1408924","DOIUrl":null,"url":null,"abstract":"The area of \"software physics and algorithmic complexity\" is providing some much needed quantization of the notions of a program and an algorithm. I am interested in those aspects of this quantization that allow one to estimate the length of an algorithm programmed in one language given the length of the same algorithm programmed in another language.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Analysis of algorithms implemented in software and hardware\",\"authors\":\"D. Ostapko\",\"doi\":\"10.1145/1408800.1408924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The area of \\\"software physics and algorithmic complexity\\\" is providing some much needed quantization of the notions of a program and an algorithm. I am interested in those aspects of this quantization that allow one to estimate the length of an algorithm programmed in one language given the length of the same algorithm programmed in another language.\",\"PeriodicalId\":204185,\"journal\":{\"name\":\"ACM '74\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '74\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1408800.1408924\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '74","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1408800.1408924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of algorithms implemented in software and hardware
The area of "software physics and algorithmic complexity" is providing some much needed quantization of the notions of a program and an algorithm. I am interested in those aspects of this quantization that allow one to estimate the length of an algorithm programmed in one language given the length of the same algorithm programmed in another language.