Results 221 to 230 of about 109,342 (269)
Everything Is Prediction: Modern Machine Learning as Bayesian Inference. [PDF]
Polson NG, Sokolov V, Soyer R.
europepmc +1 more source
One-Step Relativistic Driven Similarity Renormalization Group Multireference Perturbation Theory. [PDF]
Zhao Z, Evangelista FA.
europepmc +1 more source
Hierarchical bounds on limit cycles in disjunctive and mixed nested canalizing Boolean networks. [PDF]
Yizengaw B.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2018
The effective calculability of number-theoretic functions such as addition and multiplication has always been recognized, and for that judgment a rigorous notion of ‘computable function’ is not required. A sharp mathematical concept was defined only in the twentieth century, when issues including the decision problem for predicate logic required a ...
MUNDICI, DANIELE, W. Sieg
openaire +2 more sources
The effective calculability of number-theoretic functions such as addition and multiplication has always been recognized, and for that judgment a rigorous notion of ‘computable function’ is not required. A sharp mathematical concept was defined only in the twentieth century, when issues including the decision problem for predicate logic required a ...
MUNDICI, DANIELE, W. Sieg
openaire +2 more sources
ACM Computing Surveys, 1996
Theory of Computation (TOC) seeks to understand computational phenomena, be it natural, man-made or imaginative. TOC is an independent scientific discipline of fundamental importance. Its intrinsic goals (those which were achieved, those which are yet to be achieved, and those which are yet to be defined) transcend the immediate applicability to ...
Oded Goldreich 0001, Avi Wigderson
openaire +2 more sources
Theory of Computation (TOC) seeks to understand computational phenomena, be it natural, man-made or imaginative. TOC is an independent scientific discipline of fundamental importance. Its intrinsic goals (those which were achieved, those which are yet to be achieved, and those which are yet to be defined) transcend the immediate applicability to ...
Oded Goldreich 0001, Avi Wigderson
openaire +2 more sources
1992
It could be said that the modern theory of computation began with Alan Turing in the 1930's. After a period of steady development, work in complexity, specially that of Steve Cook and Richard Karp around 1970, gave a deeper tie of the Turing framework to the practice of the machine.
openaire +1 more source
It could be said that the modern theory of computation began with Alan Turing in the 1930's. After a period of steady development, work in complexity, specially that of Steve Cook and Richard Karp around 1970, gave a deeper tie of the Turing framework to the practice of the machine.
openaire +1 more source
A computational theory of the firm
Journal of Economic Behavior & Organization, 2002This paper proposes using computational learning theory (CLT) as a framework for analyzing the information processing behavior of firms; we argue that firms can be viewed as learning algorithms. The costs and benefits of processing information are linked to the structure of the firm and its relationship with the environment. We model the firm as a type
Barr, Jason, Saraceno, Francesco
openaire +2 more sources
A theory of computational implementation
Synthese, 2013I articulate and defend a new theory of what it is for a physical system to implement an abstract computational model. According to my descriptivist theory, a physical system implements a computational model just in case the model accurately describes the system. Specifically, the system must reliably transit between computational states in accord with
openaire +2 more sources
On a theory of computing symposia
ACM SIGACT News, 1998We consider the problem of scheduling a conference to achieve the benefits in time-compression of parallel sessions, but without the associated high degree of conflict between talks. We describe a randomized construction meeting these goals that we analyze based on an expansion property of an associated graph.
Avrim Blum, Prabhakar Raghavan
openaire +1 more source
Computational Complexity Theory
2004Week One: Complexity theory: From Godel to Feynman Complexity theory: From Godel to Feynman History and basic concepts Resources, reductions and P vs. NP Probabilistic and quantum computation Complexity classes Space complexity and circuit complexity Oracles and the polynomial time hierarchy Circuit lower bounds "Natural" proofs of lower bounds ...
openaire +1 more source

