软件和硬件实现算法分析

ACM '74 Pub Date : 1900-01-01 DOI:10.1145/1408800.1408924

D. Ostapko

{"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}

引用次数: 1

摘要

“软件物理和算法复杂性”领域提供了一些非常需要的程序和算法概念的量化。我对量化的那些方面感兴趣，这些方面允许人们在给定用另一种语言编写的相同算法的长度的情况下，估计用一种语言编写的算法的长度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM '74

自引率

0.00%

发文量