相关期刊:《Frontiers of Computer Science》《Journal of Applied Mathematics and Physics》《Journal of Mathematics and System Science》《Open Journal of Discrete Mathematics》更多>>
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...
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...
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...
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...
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...