计算机硬件和软件的复杂性(仅抽象)

Mykola Cherkassky
{"title":"计算机硬件和软件的复杂性(仅抽象)","authors":"Mykola Cherkassky","doi":"10.1145/352491.352501","DOIUrl":null,"url":null,"abstract":"The complexity characteristics of informal algorithm models, formal algorithm systems and of an algorithm device have been examined. Methods of efficient informal algorithm constructions have been systematized. The parameters of time and instrumental complexities of hardware/software environment have been precised. Introduce information characteristics as programm and structure complexities. Describe optimization methods of the four complexity charadteristics for each hierarchical level of computer environment presentation. Optimization first of all assumes using of not contradictional methods of time and programm minimization considering about relative value of each characteristic. Taking into account relative price value of each parameter, optimization first of all assumes using of not contradictional methods of minimization of time and program complexities by means of some increasing of instrumental and structural complexities, but keeping computer's functional abilities. Expedience of using complexity parameters has been demonstrated by microprocessors evolution analysis.","PeriodicalId":376536,"journal":{"name":"Symposium on Contemporary Computing in Ukraine","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complexity of the computer hardware and software (abstract only)\",\"authors\":\"Mykola Cherkassky\",\"doi\":\"10.1145/352491.352501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The complexity characteristics of informal algorithm models, formal algorithm systems and of an algorithm device have been examined. Methods of efficient informal algorithm constructions have been systematized. The parameters of time and instrumental complexities of hardware/software environment have been precised. Introduce information characteristics as programm and structure complexities. Describe optimization methods of the four complexity charadteristics for each hierarchical level of computer environment presentation. Optimization first of all assumes using of not contradictional methods of time and programm minimization considering about relative value of each characteristic. Taking into account relative price value of each parameter, optimization first of all assumes using of not contradictional methods of minimization of time and program complexities by means of some increasing of instrumental and structural complexities, but keeping computer's functional abilities. Expedience of using complexity parameters has been demonstrated by microprocessors evolution analysis.\",\"PeriodicalId\":376536,\"journal\":{\"name\":\"Symposium on Contemporary Computing in Ukraine\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Contemporary Computing in Ukraine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/352491.352501\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Contemporary Computing in Ukraine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/352491.352501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了非正式算法模型、正式算法系统和算法装置的复杂性特征。对有效的非正式算法构造方法进行了系统化。时间参数和硬件/软件环境的仪器复杂性已经精确。引入信息特征,如程序和结构复杂性。描述计算机环境表示的每个层次的四个复杂性特征的优化方法。优化首先假定采用时间和程序最小化的不矛盾方法,同时考虑各特性的相对值。考虑到各参数的相对价格,优化首先假定使用不矛盾的方法,通过增加仪器和结构的复杂性来最小化时间和程序复杂性,但保持计算机的功能能力。微处理器演化分析证明了复杂性参数的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Complexity of the computer hardware and software (abstract only)
The complexity characteristics of informal algorithm models, formal algorithm systems and of an algorithm device have been examined. Methods of efficient informal algorithm constructions have been systematized. The parameters of time and instrumental complexities of hardware/software environment have been precised. Introduce information characteristics as programm and structure complexities. Describe optimization methods of the four complexity charadteristics for each hierarchical level of computer environment presentation. Optimization first of all assumes using of not contradictional methods of time and programm minimization considering about relative value of each characteristic. Taking into account relative price value of each parameter, optimization first of all assumes using of not contradictional methods of minimization of time and program complexities by means of some increasing of instrumental and structural complexities, but keeping computer's functional abilities. Expedience of using complexity parameters has been demonstrated by microprocessors evolution analysis.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信