Results 271 to 280 of about 3,355,376 (309)
Natural complexity, computational complexity and depth [PDF]
Chaos, 2011 Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a typical system state or history starting from simple initial conditions.
Jonathan Machta
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computational sample complexity
Proceedings of the tenth annual conference on Computational learning theory - COLT '97, 1997Summary: In a variety of PAC learning models, a trade-off between time and information seems to exist: with unlimited time, a small amount of information suffices, but with time restrictions, more information sometimes seems to be required. In addition, it has long been known that there are concept classes that can be learned in the absence of ...
Scott E. Decatur +2 more
openaire +3 more sources
The Computational Complexity of Immanants
SIAM Journal on Computing, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Computational Complexity on the Blackboard
Fundamenta Informaticae, 2017This paper is an introduction to the computational complexity theory. I believe that the standard courses in complexity theory make some things much more important than they really are, while things which I find extremely interesting are marginalized.
openaire +3 more sources
On the computing paradigm and computational complexity
1995Computational complexity theory is the study of the quantitative laws that govern computing. Since the computing paradigm is universal and pervasive, the quantitative laws of computational complexity apply to all information processing from numerical computations and simulation to logical reasoning and formal theorem proving, as well as processes of ...
openaire +1 more source
Granular Computing and Computational Complexity
2010Granular computing is to imitate humans multigranular computing strategy to problem solving in order to endow computers with the same capability. Its final goal is to reduce the computational complexity. To the end, based on the simplicity principle the problem at hand should be represented as simpler as possible.
openaire +1 more source
The computational complexity of abduction
Artificial Intelligence, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tom Bylander +3 more
openaire +3 more sources
Computational complexity on computable metric spaces
Mathematical Logic Quarterly, 2003AbstractWe introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a generally infinite family of numbers looks straightforward, at ...
openaire +3 more sources
Rationality, computability, and complexity
Journal of Economic Dynamics and Control, 1990Abstract Rationality in economic theory is, almost without exception, defined in terms of choice functions and underlying preference relations. The nature of the computability of choice functions and their (algorithmic) complexity predicated upon Church's thesis seem never to have been investigated.
Velupillai, Kumaraswamy, B. Rustem
openaire +2 more sources
Mitosis in Computational Complexity
2006This expository paper describes some of the results of two recent research papers [GOP+05, GPSZ05]. The first of these papers proves that every NP-complete set is many-one autoreducible. The second paper proves that every many-one autoreducible set is many-one mitotic. It follows immediately that every NP-complete set is many-one mitotic.
Christian Glaßer +3 more
openaire +2 more sources