马尔可夫法向算法理论

2012 International Conference on Computing Sciences Pub Date : 2012-09-14 DOI:10.1109/ICCS.2012.72

Ch. Raja, G. Sathya, E. G. Rajan

{"title":"马尔可夫法向算法理论","authors":"Ch. Raja, G. Sathya, E. G. Rajan","doi":"10.1109/ICCS.2012.72","DOIUrl":null,"url":null,"abstract":"This paper presents the concept of Normal Algorithms proposed by Andreii Andreevich Markov (A. A. Markov) in 1951. This concept is analogous to that of Turing machines introduced by Alan Mathaison Turing. A mathematical object of analysis is called computable if and only if it is Turing computable. One can also define computability in terms of normal algorithms.","PeriodicalId":429916,"journal":{"name":"2012 International Conference on Computing Sciences","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Theory of Markov's Normal Algorithms\",\"authors\":\"Ch. Raja, G. Sathya, E. G. Rajan\",\"doi\":\"10.1109/ICCS.2012.72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the concept of Normal Algorithms proposed by Andreii Andreevich Markov (A. A. Markov) in 1951. This concept is analogous to that of Turing machines introduced by Alan Mathaison Turing. A mathematical object of analysis is called computable if and only if it is Turing computable. One can also define computability in terms of normal algorithms.\",\"PeriodicalId\":429916,\"journal\":{\"name\":\"2012 International Conference on Computing Sciences\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Computing Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.2012.72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Computing Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.2012.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文介绍了Andreii Andreevich Markov (A. A. Markov)在1951年提出的正规算法的概念。这个概念类似于图灵引入的图灵机。一个数学分析对象被称为可计算的当且仅当它是图灵可计算的。我们也可以根据常规算法来定义可计算性。

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

查看原文本刊更多论文

Theory of Markov's Normal Algorithms

This paper presents the concept of Normal Algorithms proposed by Andreii Andreevich Markov (A. A. Markov) in 1951. This concept is analogous to that of Turing machines introduced by Alan Mathaison Turing. A mathematical object of analysis is called computable if and only if it is Turing computable. One can also define computability in terms of normal algorithms.

求助全文

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

来源期刊

2012 International Conference on Computing Sciences

自引率

0.00%

发文量