Conecte-se

Bibliografias temáticas / Computation Theory and Mathematics / Artigos de revistas

Siga este link para ver outros tipos de publicações sobre o tema: Computation Theory and Mathematics.

Artigos de revistas sobre o tema "Computation Theory and Mathematics"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 29 de janeiro de 2023

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores artigos de revistas para estudos sobre o assunto "Computation Theory and Mathematics".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja os artigos de revistas das mais diversas áreas científicas e compile uma bibliografia correta.

1

Dean, Walter. "Computational Complexity Theory and the Philosophy of Mathematics†". Philosophia Mathematica 27, n.º 3 (1 de outubro de 2019): 381–439. http://dx.doi.org/10.1093/philmat/nkz021.

Texto completo da fonte

Resumo:

Abstract Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof.

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Maley, Carlo C. "DNA Computation: Theory, Practice, and Prospects". Evolutionary Computation 6, n.º 3 (setembro de 1998): 201–29. http://dx.doi.org/10.1162/evco.1998.6.3.201.

Texto completo da fonte

Resumo:

L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also identified three broad categories of open questions for the field. First, is DNA capable of universal computation? Second, what kinds of algorithms can DNA implement? Third, can the error rates in the manipulations of the DNA be controlled enough to allow for useful computation? In the two years that have followed, theoretical work has shown that DNA is in fact capable of universal computation. Furthermore, algorithms for solving interesting questions, like breaking the Data Encryption Standard, have been described using currently available technology and methods. Finally, a few algorithms have been proposed to handle some of the apparently crippling error rates in a few of the common processes used to manipulate DNA. It is thus unlikely that DNA computation is doomed to be only a passing curiosity. However, much work remains to be done on the containment and correction of errors. It is far from clear if the problems in the error rates can be solved sufficiently to ever allow for general-purpose computation that will challenge the more popular substrates for computation. Unfortunately, biological demonstrations of the theoretical results have been sadly lacking. To date, only the simplest of computations have been carried out in DNA. To make significant progress, the field will require both the assessment of the practicality of the different manipulations of DNA and the implementation of algorithms for realistic problems. Theoreticians, in collaboration with experimentalists, can contribute to this research program by settling on a small set of practical and efficient models for DNA computation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Yamada, Shinichi. "A mathematical theory of randomized computation, I". Proceedings of the Japan Academy, Series A, Mathematical Sciences 64, n.º 4 (1988): 115–18. http://dx.doi.org/10.3792/pjaa.64.115.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Yamada, Shinichi. "A mathematical theory of randomized computation, II". Proceedings of the Japan Academy, Series A, Mathematical Sciences 64, n.º 5 (1988): 155–58. http://dx.doi.org/10.3792/pjaa.64.155.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Yamada, Shinichi. "A mathematical theory of randomized computation, III". Proceedings of the Japan Academy, Series A, Mathematical Sciences 64, n.º 6 (1988): 201–4. http://dx.doi.org/10.3792/pjaa.64.201.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Duhr, Claude. "Function Theory for Multiloop Feynman Integrals". Annual Review of Nuclear and Particle Science 69, n.º 1 (19 de outubro de 2019): 15–39. http://dx.doi.org/10.1146/annurev-nucl-101918-023551.

Texto completo da fonte

Resumo:

Precise predictions for collider observables require the computation of higher orders in perturbation theory. This task usually involves the evaluation of complicated multiloop integrals, which typically give rise to complicated special functions. This article discusses recent progress in understanding the mathematics underlying multiloop Feynman integrals and discusses a class of functions that generalizes the logarithm and that often appears in multiloop computations. The same class of functions is an active area of research in modern mathematics, which has led to the development of new powerful tools to compute Feynman integrals. These tools are at the heart of some of the most complicated computations ever performed for a hadron collider.

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Lenstra Jr., H. W., Steven M. Serbin, Stig Larsson, Ohannes Karakashian, J. Thomas King e Ewald Quak. "Book Review: Mathematics of Computation 1943--1993: A half-century of computational mathematics". Mathematics of Computation 66, n.º 219 (1 de julho de 1997): 1367–75. http://dx.doi.org/10.1090/s0025-5718-97-00877-6.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Conceição, Ana C., e Jéssica C. Pires. "Symbolic Computation Applied to Cauchy Type Singular Integrals". Mathematical and Computational Applications 27, n.º 1 (31 de dezembro de 2021): 3. http://dx.doi.org/10.3390/mca27010003.

Texto completo da fonte

Resumo:

The development of operator theory is stimulated by the need to solve problems emerging from several fields in mathematics and physics. At the present time, this theory has wide applications in the study of non-linear differential equations, in linear transport theory, in the theory of diffraction of acoustic and electromagnetic waves, in the theory of scattering and of inverse scattering, among others. In our work, we use the computer algebra system Mathematica to implement, for the first time on a computer, analytical algorithms developed by us and others within operator theory. The main goal of this paper is to present new operator theory algorithms related to Cauchy type singular integrals, defined in the unit circle. The design of these algorithms was focused on the possibility of implementing on a computer all the extensive symbolic and numeric calculations present in the algorithms. Several nontrivial examples computed with the algorithms are presented. The corresponding source code of the algorithms has been made available as a supplement to the online edition of this article.

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Edalat, Abbas. "Domains for Computation in Mathematics, Physics and Exact Real Arithmetic". Bulletin of Symbolic Logic 3, n.º 4 (dezembro de 1997): 401–52. http://dx.doi.org/10.2307/421098.

Texto completo da fonte

Resumo:

AbstractWe present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence and uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chaos; we also show how efficient algorithms have been obtained for computing elementary functions in exact real arithmetic.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Doerr, Benjamin, e Thomas Jansen. "Theory of Evolutionary Computation". Algorithmica 59, n.º 3 (9 de novembro de 2010): 299–300. http://dx.doi.org/10.1007/s00453-010-9472-3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Levesley, Jeremy. "Functions of matrices: Theory and computation". Bulletin of the London Mathematical Society 41, n.º 6 (dezembro de 2009): 1145–46. http://dx.doi.org/10.1112/blms/bdp112.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

TESSON, PASCAL, e DENIS THÉRIEN. "MONOIDS AND COMPUTATIONS". International Journal of Algebra and Computation 14, n.º 05n06 (outubro de 2004): 801–16. http://dx.doi.org/10.1142/s0218196704001979.

Texto completo da fonte

Resumo:

This contribution wishes to argue in favor of increased interaction between experts on finite monoids and specialists of theory of computation. Developing the algebraic approach to formal computations as well as the computational point of view on monoids will prove to be beneficial to both communities. We give examples of this two-way relationship coming from temporal logic, communication complexity and Boolean circuits. Although mostly expository in nature, our paper proves some new results along the way.

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Green, Frederic. "Review of Mathematics and Computation by Avi Wigderson". ACM SIGACT News 52, n.º 3 (17 de outubro de 2021): 6–10. http://dx.doi.org/10.1145/3494656.3494659.

Texto completo da fonte

Resumo:

Mathematics and computation are inextricably entangled3. We couldn't do one without the other. The need to calculate can be traced to early human history, and mathematics developed in large part to enable computation. And computation is necessary to propel mathematics. One often loses sight of the fact that the great mathematicians of the past were also prodigious computers: For example, Gauss, Kummer and the other great pioneers of number theory did vast amounts of computation to arrive at or reinforce many of their insights.

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Vejdemo-Johansson, Mikael. "Blackbox computation of A ∞-algebras". gmj 17, n.º 2 (junho de 2010): 391–404. http://dx.doi.org/10.1515/gmj.2010.005.

Texto completo da fonte

Resumo:

Abstract Kadeishvili's proof of theminimality theorem [T. Kadeishvili, On the homology theory of fiber spaces, Russ. Math. Surv. 35:3 (1980), 231–238] induces an algorithm for the inductive computation of an A ∞-algebra structure on the homology of a dg-algebra. In this paper, we prove that for one class of dg-algebras, the resulting computation will generate a complete A ∞-algebra structure after a finite amount of computational work.

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

CHANG, EE-CHIEN, SUNG WOO CHOI, DO YONG KWON, HYUNGJU PARK e CHEE K. YAP. "SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE". International Journal of Computational Geometry & Applications 16, n.º 05n06 (dezembro de 2006): 567–90. http://dx.doi.org/10.1142/s0218195906002191.

Texto completo da fonte

Resumo:

An open question in Exact Geometric Computation is whether there are transcendental computations that can be made "geometrically exact". Perhaps the simplest such problem in computational geometry is that of computing the shortest obstacle-avoiding path between two points p,q in the plane, where the obstacles are a collection of n discs. This problem can be solved in O(n2 log n) time in the Real RAM model, but nothing was known about its computability in the standard (Turing) model of computation. We first give a direct proof of the Turing-computability of this problem, provided the radii of the discs are rationally related. We make the usual assumption that the numerical input data are real algebraic numbers. By appealing to effective bounds from transcendental number theory, we further show a single-exponential time upper bound when the input numbers are rational. Our result appears to be the first example of a non-algebraic combinatorial problem which is shown computable. It is also a rare example of transcendental number theory yielding positive computational results.

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Kaddoum, G., Anthony J. Lawrance, P. Chargé e D. Roviras. "Chaos Communication Performance: Theory and Computation". Circuits, Systems, and Signal Processing 30, n.º 1 (14 de outubro de 2010): 185–208. http://dx.doi.org/10.1007/s00034-010-9217-1.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Chen, Naiwu (N N. Chan), e Jiankeng (Li Kimhung) Li. "Theory and computation of restricted linear models". Acta Mathematicae Applicatae Sinica 4, n.º 4 (novembro de 1988): 378–86. http://dx.doi.org/10.1007/bf02007242.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

AGRAWAL, MANINDRA, BARRY COOPER e ANGSHENG LI. "Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008–2009)". Mathematical Structures in Computer Science 20, n.º 5 (outubro de 2010): 705–6. http://dx.doi.org/10.1017/s0960129510000277.

Texto completo da fonte

Resumo:

The Theory and Applications of Models of Computation (TAMC) conference series is both international and interdisciplinary in character, bringing together researchers working in computer science, mathematics (especially logic) and the physical sciences. It is this, together with its predominantly computational and computability theoretic focus, that gives the series its special character.

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Burgin, Mark, e Rao Mikkililineni. "Seven Layers of Computation: Methodological Analysis and Mathematical Modeling". Filozofia i Nauka Zeszyt specjalny, n.º 10 (10 de maio de 2022): 11–32. http://dx.doi.org/10.37240/fin.2022.10.zs.1.

Texto completo da fonte

Resumo:

We live in an information society where the usage, creation, distribution, manipulation, and integration of information is a significant activity. Computations allow us to process information from various sources in various forms and use the derived knowledge in improving efficiency and resilience in our interactions with each other and with our environment. The general theory of information tells us that information to knowledge is as energy is to matter. Energy has the potential to create or modify material structures and information has the potential to create or modify knowledge structures. In this paper, we analyze computations as a vital technological phenomenon of contemporary society which allows us to process and use information. This analysis allows building classifications of computations based on their characteristics and explication of new types of computations. As a result, we extend the existing typologies of computations by delineating novel forms of information representations. While the traditional approach deals only with two dimensions of computation—symbolic and sub-symbolic, here we describe additional dimensions, namely, super-symbolic computation, hybrid computation, fused computation, blended computation, and symbiotic computation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Lee, Ciarán M., e Matty J. Hoban. "Bounds on the power of proofs and advice in general physical theories". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 472, n.º 2190 (junho de 2016): 20160076. http://dx.doi.org/10.1098/rspa.2016.0076.

Texto completo da fonte

Resumo:

Quantum theory presents us with the tools for computational and communication advantages over classical theory. One approach to uncovering the source of these advantages is to determine how computation and communication power vary as quantum theory is replaced by other operationally defined theories from a broad framework of such theories. Such investigations may reveal some of the key physical features required for powerful computation and communication. In this paper, we investigate how simple physical principles bound the power of two different computational paradigms which combine computation and communication in a non-trivial fashion: computation with advice and interactive proof systems. We show that the existence of non-trivial dynamics in a theory implies a bound on the power of computation with advice. Moreover, we provide an explicit example of a theory with no non-trivial dynamics in which the power of computation with advice is unbounded. Finally, we show that the power of simple interactive proof systems in theories where local measurements suffice for tomography is non-trivially bounded. This result provides a proof that Q M A is contained in P P , which does not make use of any uniquely quantum structure—such as the fact that observables correspond to self-adjoint operators—and thus may be of independent interest.

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Legatiuk, Dmitrii. "Mathematical Modelling by Help of Category Theory: Models and Relations between Them". Mathematics 9, n.º 16 (15 de agosto de 2021): 1946. http://dx.doi.org/10.3390/math9161946.

Texto completo da fonte

Resumo:

The growing complexity of modern practical problems puts high demand on mathematical modelling. Given that various models can be used for modelling one physical phenomenon, the role of model comparison and model choice is becoming particularly important. Methods for model comparison and model choice typically used in practical applications nowadays are computation-based, and thus time consuming and computationally costly. Therefore, it is necessary to develop other approaches to working abstractly, i.e., without computations, with mathematical models. An abstract description of mathematical models can be achieved by the help of abstract mathematics, implying formalisation of models and relations between them. In this paper, a category theory-based approach to mathematical modelling is proposed. In this way, mathematical models are formalised in the language of categories, relations between the models are formally defined and several practically relevant properties are introduced on the level of categories. Finally, an illustrative example is presented, underlying how the category-theory based approach can be used in practice. Further, all constructions presented in this paper are also discussed from a modelling point of view by making explicit the link to concrete modelling scenarios.

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Vyas, Saurabh, Matthew D. Golub, David Sussillo e Krishna V. Shenoy. "Computation Through Neural Population Dynamics". Annual Review of Neuroscience 43, n.º 1 (8 de julho de 2020): 249–75. http://dx.doi.org/10.1146/annurev-neuro-092619-094115.

Texto completo da fonte

Resumo:

Significant experimental, computational, and theoretical work has identified rich structure within the coordinated activity of interconnected neural populations. An emerging challenge now is to uncover the nature of the associated computations, how they are implemented, and what role they play in driving behavior. We term this computation through neural population dynamics. If successful, this framework will reveal general motifs of neural population activity and quantitatively describe how neural population dynamics implement computations necessary for driving goal-directed behavior. Here, we start with a mathematical primer on dynamical systems theory and analytical tools necessary to apply this perspective to experimental data. Next, we highlight some recent discoveries resulting from successful application of dynamical systems. We focus on studies spanning motor control, timing, decision-making, and working memory. Finally, we briefly discuss promising recent lines of investigation and future directions for the computation through neural population dynamics framework.

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

KONDRAT’EVA, M. V., A. B. LEVIN, A. V. MIKHALEV e E. V. PANKRAT’EV. "COMPUTATION OF DIMENSION POLYNOMIALS". International Journal of Algebra and Computation 02, n.º 02 (junho de 1992): 117–37. http://dx.doi.org/10.1142/s0218196792000098.

Texto completo da fonte

Resumo:

The consideration of differential versions of Hilbert dimension polynomials is due to A. Einstein [1] and E. Kolchin [2] (one can find the coverage of the theory of differential dimension polynomials in [6]). In this paper we introduce the notion of a dimension polynomial of a subset of ℕm associated with arbitrary partition of the set {1,…, m} into disjoint nonempty subsets (m∈ℕ, ℕ denoting the set of all nonnegative integers). The theory of such polynomials is developed. The importance of our considerations is connected with the fact that the computation of differential and difference dimen sion polynomials may be reduced to the computation of some dimension polynomials of subsets of ℕm where m∈ℕ (see [3, p. 115], [5]). We also give some methods and algorithms for computation of dimension polynomials.

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

BLUM, LENORE, FELIPE CUCKER, MIKE SHUB e STEVE SMALE. "COMPLEXITY AND REAL COMPUTATION: A MANIFESTO". International Journal of Bifurcation and Chaos 06, n.º 01 (janeiro de 1996): 3–26. http://dx.doi.org/10.1142/s0218127496001818.

Texto completo da fonte

Resumo:

Finding a natural meeting ground between the highly developed complexity theory of computer science — with its historical roots in logic and the discrete mathematics of the integers — and the traditional domain of real computation, the more eclectic less foundational field of numerical analysis — with its rich history and longstanding traditions in the continuous mathematics of analysis — presents a compelling challenge. Here we illustrate the issues and pose our perspective toward resolution.

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Lauder, Alan G. B. "Deformation theory and the computation of zeta functions". Proceedings of the London Mathematical Society 88, n.º 03 (14 de abril de 2004): 565–602. http://dx.doi.org/10.1112/s0024611503014461.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Al-Khaled, Kamel. "Theory and computation in singular boundary value problems". Chaos, Solitons & Fractals 33, n.º 2 (julho de 2007): 678–84. http://dx.doi.org/10.1016/j.chaos.2006.01.047.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Nord, Gail D., David Jabon e John Nord. "Activities: The Mathematics of the Global Positioning System". Mathematics Teacher 90, n.º 6 (setembro de 1997): 455–60. http://dx.doi.org/10.5951/mt.90.6.0455.

Texto completo da fonte

Resumo:

Teacher's Guide: The Global Positioning System (GPS) is a constellation of twenty-four satellites, orbiting approximately 20 200 km above sea level, that enable receivers to compute their position anywhere on the earth with remarkable accuracy. The mathematical theory and computation involved in the GPS are within the scope of the second-year-algebra curriculum. This activity illustrates an application of mathematics to modern navigation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Cooper, S. Barry, Benedikt Lowe e Peter van Emde Boas. "Theory of Computation at CiE 2005". Theory of Computing Systems 41, n.º 1 (julho de 2007): 1–2. http://dx.doi.org/10.1007/s00224-006-4101-x.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Agler, Jim, John Harland e Benjamin J. Raphael. "Classical function theory, operator dilation theory, and machine computation on multiply-connected domains". Memoirs of the American Mathematical Society 191, n.º 892 (2008): 0. http://dx.doi.org/10.1090/memo/0892.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Geiser, Jürgen. "Embedded Zassenhaus Expansion to Splitting Schemes: Theory and Multiphysics Applications". International Journal of Differential Equations 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/314290.

Texto completo da fonte

Resumo:

We present some operator splitting methods improved by the use of the Zassenhaus product and designed for applications to multiphysics problems. We treat iterative splitting methods that can be improved by means of the Zassenhaus product formula, which is a sequential splitting scheme. The main idea for reducing the computation time needed by the iterative scheme is to embed fast and cheap Zassenhaus product schemes, since the computation of the commutators involved is very cheap, since we are dealing with nilpotent matrices. We discuss the coupling ideas of iterative and sequential splitting techniques and their convergence. While the iterative splitting schemes converge slowly in their first iterative steps, we improve the initial convergence rates by embedding the Zassenhaus product formula. The applications are to multiphysics problems in fluid dynamics. We consider phase models in computational fluid dynamics and analyse how to obtain higher order operator splitting methods based on the Zassenhaus product. The computational benefits derive from the use of sparse matrices, which arise from the spatial discretisation of the underlying partial differential equations. Since the Zassenhaus formula requires nearly constant CPU time due to its sparse commutators, we have accelerated the iterative splitting schemes.

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Nien, Chia-Hsing, e Frederick J. Wicklin. "An Algorithm for the Computation of Preimages in Noninvertible Mappings". International Journal of Bifurcation and Chaos 08, n.º 02 (fevereiro de 1998): 415–22. http://dx.doi.org/10.1142/s0218127498000279.

Texto completo da fonte

Resumo:

For discrete dynamical systems generated by iterating a diffeomorphism, every point in the phase space has a unique preimage and it is straightforward to compute geometric structures such as inverse orbits and one-dimensional stable manifolds of periodic points. For noninvertible mappings, however, some points have multiple preimages; others may have no preimages. This makes the computation of inverse orbits difficult, because accurate computations require global knowledge about the way the mapping folds and pleats phase space. In this article we use ideas from singularity theory to examine the geometry of noninvertible mappings. We use the geometry to derive a computational algorithm for efficiently computing preimages in noninvertible mappings.

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Okazaki, Hiroyuki, e Yuichi Futa. "Polynomially Bounded Sequences and Polynomial Sequences". Formalized Mathematics 23, n.º 3 (1 de setembro de 2015): 205–13. http://dx.doi.org/10.1515/forma-2015-0017.

Texto completo da fonte

Resumo:

Abstract In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we formalize polynomial sequences [5].

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Liu, Xue Ting. "The Judgement for Generalized Positive Definite Matrices in Signal Processing". Advanced Materials Research 121-122 (junho de 2010): 128–32. http://dx.doi.org/10.4028/www.scientific.net/amr.121-122.128.

Texto completo da fonte

Resumo:

The generalized positive definite matrix is an active research field of special matrix, they have applied in computational mathematics, economics, physics, biology, applied mathematics, numerical computation, signal processing, coding theory, oil investigation in recent years, and so on. In this paper, motivated by [3], we give a simple and convenient judging methodwhich can be used to judge whether an nonnegative real matrix A is an generalized positive definite matrix or not.

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Yoosefzadeh, H. R., Hamed R. Tareghian e M. H. Farahi. "Tri-directional Scheduling Scheme: Theory and Computation". Journal of Mathematical Modelling and Algorithms 9, n.º 4 (22 de maio de 2010): 357–73. http://dx.doi.org/10.1007/s10852-010-9132-2.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

DOUGHERTY, EDWARD R., e ULISSES BRAGA-NETO. "EPISTEMOLOGY OF COMPUTATIONAL BIOLOGY: MATHEMATICAL MODELS AND EXPERIMENTAL PREDICTION AS THE BASIS OF THEIR VALIDITY". Journal of Biological Systems 14, n.º 01 (março de 2006): 65–90. http://dx.doi.org/10.1142/s0218339006001726.

Texto completo da fonte

Resumo:

Knowing the roles of mathematics and computation in experimental science is important for computational biology because these roles determine to a great extent how research in this field should be pursued and how it should relate to biology in general. The present paper examines the epistemology of computational biology from the perspective of modern science, the underlying principle of which is that a scientific theory must have two parts: (1) a structural model, which is a mathematical construct that aims to represent a selected portion of physical reality and (2) a well-defined procedure for relating consequences of the model to quantifiable observations. We also explore the contingency and creative nature of a scientific theory. Among the questions considered are: Can computational biology form the theoretical core of biology? What is the basis, if any, for choosing one particular model over another? And what is the role of computation in science, and in biology in particular? We examine how this broad epistemological framework applies to important statistical methodologies pertaining to computational biology, such as expression-based phenotype classification, gene regulatory networks, and clustering. We consider classification in detail, as the epistemological issues raised by classification are related to all computational-biology topics in which statistical prediction plays a key role. We pay particular attention to classifier-model validity and its relation to estimation rules.

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Karp, Richard M. "George Dantzig’s impact on the theory of computation". Discrete Optimization 5, n.º 2 (maio de 2008): 174–85. http://dx.doi.org/10.1016/j.disopt.2006.12.004.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

N., S. P., e Richard C. Aiken. "Stiff Computation." Mathematics of Computation 47, n.º 176 (outubro de 1986): 755. http://dx.doi.org/10.2307/2008193.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

FU, YUXI. "Non-deterministic structures of computation". Mathematical Structures in Computer Science 25, n.º 6 (10 de novembro de 2014): 1295–338. http://dx.doi.org/10.1017/s0960129514000012.

Texto completo da fonte

Resumo:

Divergence and non-determinism play a fundamental role in the theory of computation, and their combined effect on computational equality deserves further study. By looking at the issue from the point of view of both computation and interaction, we are led to a canonical equality for non-deterministic computation, revealing its rich algebraic structure. We study this structure in three ways. First, we construct a complete equational system for finite-state non-deterministic computation. The challenge with such a system is to find an equational alternative to fixpoint inductionà laMilner. We establish a negative result in the form of the non-existence of a finite equational system for the canonical equality of non-deterministic computation to support our approach. We then investigate infinite-state non-deterministic computation in the light of definability and show that every recursively enumerable set is generated by an unobservable process. Finally, we prove that, as far as computation is concerned, the effect produced jointly by divergence and non-determinism is model independent for a large class of process models.We use C-graphs, which are interesting in their own right, as abstract representations of the computational objects throughout the paper.

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Baldoni, V., N. Berline, M. Köppe e M. Vergne. "INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY". Mathematika 59, n.º 1 (5 de setembro de 2012): 1–22. http://dx.doi.org/10.1112/s0025579312000101.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Dagnino, Francesco. "A Meta-theory for Big-step Semantics". ACM Transactions on Computational Logic 23, n.º 3 (31 de julho de 2022): 1–50. http://dx.doi.org/10.1145/3522729.

Texto completo da fonte

Resumo:

It is well known that big-step semantics is not able to distinguish stuck and non-terminating computations. This is a strong limitation as it makes it very difficult to reason about properties involving infinite computations, such as type soundness, which cannot even be expressed. We show that this issue is only apparent: the distinction between stuck and diverging computations is implicit in any big-step semantics and it just needs to be uncovered. To achieve this goal, we develop a systematic study of big-step semantics: we introduce an abstract definition of what a big-step semantics is, we define a notion of computation by formalizing the evaluation algorithm implicitly associated with any big-step semantics, and we show how to canonically extend a big-step semantics to characterize stuck and diverging computations. Building on these notions, we describe a general proof technique to show that a predicate is sound, that is, it prevents stuck computation, with respect to a big-step semantics. One needs to check three properties relating the predicate and the semantics, and if they hold, the predicate is sound. The extended semantics is essential to establish this meta-logical result but is of no concerns to the user, who only needs to prove the three properties of the initial big-step semantics. Finally, we illustrate the technique by several examples, showing that it is applicable also in cases where subject reduction does not hold, and hence the standard technique for small-step semantics cannot be used.

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Lou, Shan, Xiangqian Jiang e Paul J. Scott. "Geometric computation theory for morphological filtering on freeform surfaces". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 469, n.º 2159 (8 de novembro de 2013): 20130150. http://dx.doi.org/10.1098/rspa.2013.0150.

Texto completo da fonte

Resumo:

Surfaces govern functional behaviours of geometrical products, especially high-precision and high-added-value products. Compared with the mean line-based filters, morphological filters, evolved from the traditional E-system, are relevant to functional performance of surfaces. The conventional implementation of morphological filters based on image-processing does not work for state-of-the-art surfaces, for example, freeform surfaces. A set of novel geometric computation theory is developed by applying the alpha shape to the computation. Divide and conquer optimization is employed to speed up the computational performance of the alpha-shape method and reduce memory usage. To release the dependence of the alpha-shape method on the Delaunay triangulation, a set of definitions and propositions for the search of contact points is presented and mathematically proved based on alpha shape theory, which are applicable to both circular and horizontal flat structuring elements. The developed methods are verified through experimentation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Blass, Andreas, e Yuri Gurevich. "Witness algebra and anyon braiding". Mathematical Structures in Computer Science 30, n.º 3 (março de 2020): 234–70. http://dx.doi.org/10.1017/s0960129520000055.

Texto completo da fonte

Resumo:

AbstractTopological quantum computation employs two-dimensional quasiparticles called anyons. The generally accepted mathematical basis for the theory of anyons is the framework of modular tensor categories. That framework involves a substantial amount of category theory and is, as a result, considered rather difficult to understand. Is the complexity of the present framework necessary? The computations of associativity and braiding matrices can be based on a much simpler framework, which looks less like category theory and more like familiar algebra. We introduce that framework here.

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Farmer, William M., Joshua D. Guttman e F. Javier Thayer. "Contexts in Mathematical Reasoning and Computation". Journal of Symbolic Computation 19, n.º 1-3 (janeiro de 1995): 201–16. http://dx.doi.org/10.1006/jsco.1995.1012.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Demanet, Laurent, e Gabriel Peyré. "Compressive Wave Computation". Foundations of Computational Mathematics 11, n.º 3 (24 de fevereiro de 2011): 257–303. http://dx.doi.org/10.1007/s10208-011-9085-5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Junde, Wu. "Special Issue “Quantum computation complexity theory and quantum network theory” (Preface)". International Journal of Theoretical Physics 60, n.º 7 (2 de junho de 2021): 2345. http://dx.doi.org/10.1007/s10773-021-04846-5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Larsen, Brett W., e Shaul Druckmann. "Towards a more general understanding of the algorithmic utility of recurrent connections". PLOS Computational Biology 18, n.º 6 (21 de junho de 2022): e1010227. http://dx.doi.org/10.1371/journal.pcbi.1010227.

Texto completo da fonte

Resumo:

Lateral and recurrent connections are ubiquitous in biological neural circuits. Yet while the strong computational abilities of feedforward networks have been extensively studied, our understanding of the role and advantages of recurrent computations that might explain their prevalence remains an important open challenge. Foundational studies by Minsky and Roelfsema argued that computations that require propagation of global information for local computation to take place would particularly benefit from the sequential, parallel nature of processing in recurrent networks. Such “tag propagation” algorithms perform repeated, local propagation of information and were originally introduced in the context of detecting connectedness, a task that is challenging for feedforward networks. Here, we advance the understanding of the utility of lateral and recurrent computation by first performing a large-scale empirical study of neural architectures for the computation of connectedness to explore feedforward solutions more fully and establish robustly the importance of recurrent architectures. In addition, we highlight a tradeoff between computation time and performance and construct hybrid feedforward/recurrent models that perform well even in the presence of varying computational time limitations. We then generalize tag propagation architectures to propagating multiple interacting tags and demonstrate that these are efficient computational substrates for more general computations of connectedness by introducing and solving an abstracted biologically inspired decision-making task. Our work thus clarifies and expands the set of computational tasks that can be solved efficiently by recurrent computation, yielding hypotheses for structure in population activity that may be present in such tasks.

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

SPITTERS, BAS, e EELIS VAN DER WEEGEN. "Type classes for mathematics in type theory". Mathematical Structures in Computer Science 21, n.º 4 (1 de julho de 2011): 795–825. http://dx.doi.org/10.1017/s0960129511000119.

Texto completo da fonte

Resumo:

The introduction of first-class type classes in the Coq system calls for a re-examination of the basic interfaces used for mathematical formalisation in type theory. We present a new set of type classes for mathematics and take full advantage of their unique features to make practical a particularly flexible approach that was formerly thought to be unfeasible. Thus, we address traditional proof engineering challenges as well as new ones resulting from our ambition to build upon this development a library of constructive analysis in which any abstraction penalties inhibiting efficient computation are reduced to a minimum.The basis of our development consists of type classes representing a standard algebraic hierarchy, as well as portions of category theory and universal algebra. On this foundation, we build a set of mathematically sound abstract interfaces for different kinds of numbers, succinctly expressed using categorical language and universal algebra constructions. Strategic use of type classes lets us support these high-level theory-friendly definitions, while still enabling efficient implementations unhindered by gratuitous indirection, conversion or projection.Algebra thrives on the interplay between syntax and semantics. The Prolog-like abilities of type class instance resolution allow us to conveniently define a quote function, thus facilitating the use of reflective techniques.

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Blaine, Larry. "Theory vs. Computation in Some Very Simple Dynamical Systems". College Mathematics Journal 22, n.º 1 (janeiro de 1991): 42. http://dx.doi.org/10.2307/2686737.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Liebling, Thomas M., Denis Naddef e Laurence A. Wolsey. "Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004". Mathematical Programming 105, n.º 2-3 (10 de novembro de 2005): 157–60. http://dx.doi.org/10.1007/s10107-005-0646-8.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Bailey, David H., Jonathan M. Borwein e Richard E. Crandall. "Computation and theory of extended Mordell-Tornheim-Witten sums". Mathematics of Computation 83, n.º 288 (23 de janeiro de 2014): 1795–821. http://dx.doi.org/10.1090/s0025-5718-2014-02768-3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!