COMPUTABILITY

作品数:6被引量:4H指数:2
导出分析报告
相关领域:自动化与计算机技术更多>>
相关作者:许道云更多>>
相关机构:贵州大学更多>>
相关期刊:《Frontiers of Computer Science》《Journal of Applied Mathematics and Physics》《Journal of Mathematics and System Science》《Open Journal of Discrete Mathematics》更多>>
相关基金:国家自然科学基金更多>>
-

检索结果分析

结果分析中...
条 记 录,以下是1-6
视图:
排序:
Understanding the Theory of Karp, Miller and Winograd
《Journal of Applied Mathematics and Physics》2024年第4期1203-1236,共34页Athanasios I. Margaris 
The objective of this tutorial is to present the fundamental theory of Karp, Miller and Winograd, whose seminal paper laid the foundations regarding the systematic description of the organization of computations in sy...
关键词:COMPUTABILITY SCHEDULING COMPUTATIONS Recurrent Equations 
Formularless Logic Function
《Open Journal of Discrete Mathematics》2013年第1期21-24,共4页Alexey Nikolayevitch Teterin 
The concept of computability is defined more exactly and illustrated as an example of Boolean functions and cryptanalysis. To define a Boolean function is not necessary to record its formula. To do that the reduced (c...
关键词:COMPLEXITY of Computation(03D15) Models of Computation(68Q05) Analysis of Algorithms and Problem Complexity(68Q25) Computational Learning Theory(68Q32) SEPARABILITY SATISFIABILITY FUZZINESS Dynamical Systems COMPUTABILITY 
A general framework for computing maximal contractions被引量:2
《Frontiers of Computer Science》2013年第1期83-94,共12页Jie LUO 
This paper investigates the problem of computing all maximal contractions of a given formula set F with re- spect to a consistent set A of atomic formulas and negations of atomic formulas. We first give a constructive...
关键词:maximal contraction minimal inconsistent sub- set COMPUTABILITY algorithms 
Interweavings of Alan Turing's Mathematics and Sociology of Knowledge
《Journal of Mathematics and System Science》2012年第7期420-429,共10页Isabel Cafezeiro Ivan da Costa Marques 
This paper starts from the analysis of how Alan Turing proceeded to build the notion of computability in his famous 1936 text "On computable numbers, with an application to the Entscheidungsproblem". Looking in deta...
关键词:COMPUTABILITY Alan Tttring knowledge construction. 
Representations of Co-regular Subsets on Euclidean Spaces被引量:2
《Chinese Quarterly Journal of Mathematics》2007年第2期252-257,共6页邱玉文 王莉萍 赵希顺 
Supported by the NSFC(60573011)
For the computability of co-regular subsets in metric spaces, the properties of the co-regular subsets and several reasonable representations on co-regular sets have been suggested in this paper. As last, the 'weaker...
关键词:type-2 theory of effectivity COMPUTABILITY computable set REPRESENTATIONS 
Notes on interaction and Turing-computability
《Chinese Science Bulletin》2004年第23期2543-2544,共2页LIUXingwu XUZhiwei SUNYuzhong 
关键词:交互作用 图灵机 可计算性 计算机技术 
检索报告 对象比较 聚类工具 使用帮助 返回顶部