Готові списки джерел за темами / Computation Theory and Mathematics

Добірка наукової літератури з теми "Computation Theory and Mathematics"

Автор: Grafiati
Опубліковано: 4 червня 2021
Оновлено: 29 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Computation Theory and Mathematics".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Computation Theory and Mathematics"

1

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

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

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

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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

Повний текст джерела
Анотація:
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.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Computation Theory and Mathematics"

1

Bryant, Ross. "A Computation of Partial Isomorphism Rank on Ordinal Structures." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5387/.

Повний текст джерела
Анотація:
We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Zhang, Yue. "Sparsity in Image Processing and Machine Learning: Modeling, Computation and Theory." Case Western Reserve University School of Graduate Studies / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=case1523017795312546.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Semegni, Jean Yves. "On the computation of freely generated modular lattices." Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/1207.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Khafizov, Farid T. "Descriptions and Computation of Ultrapowers in L(R)." Thesis, University of North Texas, 1995. https://digital.library.unt.edu/ark:/67531/metadc277867/.

Повний текст джерела
Анотація:
The results from this dissertation are an exact computation of ultrapowers by measures on cardinals $\aleph\sb{n},\ n\in w$, in $L(\IR$), and a proof that ordinals in $L(\IR$) below $\delta\sbsp{5}{1}$ represented by descriptions and the identity function with respect to sequences of measures are cardinals. An introduction to the subject with the basic definitions and well known facts is presented in chapter I. In chapter II, we define a class of measures on the $\aleph\sb{n},\ n\in\omega$, in $L(\IR$) and derive a formula for an exact computation of the ultrapowers of cardinals by these measures. In chapter III, we give the definitions of descriptions and the lowering operator. Then we prove that ordinals represented by descriptions and the identity function are cardinals. This result combined with the fact that every cardinal $<\delta\sbsp{5}{1}$ in $L(\IR$) is represented by a description (J1), gives a characterization of cardinals in $L(\IR$) below $\delta\sbsp{5}{1}. Concrete examples of formal computations are shown in chapter IV.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Theeranaew, Wanchat. "STUDY ON INFORMATION THEORY: CONNECTION TO CONTROL THEORY, APPROACH AND ANALYSIS FOR COMPUTATION." Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1416847576.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Marsden, Daniel. "Logical aspects of quantum computation." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:e99331a3-9d93-4381-8075-ad843fb9b77c.

Повний текст джерела
Анотація:
A fundamental component of theoretical computer science is the application of logic. Logic provides the formalisms by which we can model and reason about computational questions, and novel computational features provide new directions for the development of logic. From this perspective, the unusual features of quantum computation present both challenges and opportunities for computer science. Our existing logical techniques must be extended and adapted to appropriately model quantum phenomena, stimulating many new theoretical developments. At the same time, tools developed with quantum applications in mind often prove effective in other areas of logic and computer science. In this thesis we explore logical aspects of this fruitful source of ideas, with category theory as our unifying framework. Inspired by the success of diagrammatic techniques in quantum foundations, we begin by demonstrating the effectiveness of string diagrams for practical calculations in category theory. We proceed by example, developing graphical formulations of the definitions and proofs of many topics in elementary category theory, such as adjunctions, monads, distributive laws, representable functors and limits and colimits. We contend that these tools are particularly suitable for calculations in the field of coalgebra, and continue to demonstrate the use of string diagrams in the remainder of the thesis. Our coalgebraic studies commence in chapter 3, in which we present an elementary formulation of a representation result for the unitary transformations, following work developed in a fibrational setting in [Abramsky, 2010]. That paper raises the question of what a suitable "fibred coalgebraic logic" would be. This question is the starting point for our work in chapter 5, in which we introduce a parameterized, duality based frame- work for coalgebraic logic. We show sufficient conditions under which dual adjunctions and equivalences can be lifted to fibrations of (co)algebras. We also prove that the semantics of these logics satisfy certain "institution conditions" providing harmony between syntactic and semantic transformations. We conclude by studying the impact of parameterization on another logical aspect of coalgebras, in which certain fibrations of predicates can be seen as generalized invariants. Our focus is on the lifting of coalgebra structure along a fibration from the base category to an associated total category of predicates. We show that given a suitable parameterized generalization of the usual liftings of signature functors, this induces a "fibration of fibrations" capturing the relationship between the two different axes of variation.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Kirk, Neil Patrick. "Computational aspects of singularity theory." Thesis, University of Liverpool, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359187.

Повний текст джерела
Анотація:
In this thesis we develop computational methods suitable for performing the symbolic calculations common to local singularity theory. For classification theory we employ the unipotent determinacy techniques of Bruce, du Plessis, Wall and complete transversal theorems of Bruce, du Plessis. The latter results are, as yet, unpublished and we spend some time reviewing these results, extending them to filtrations of the module m,,,.E (n, p) other than the standard filtration by degree. Weighted filtrations and filtrations induced by the action of a nilpotent Lie algebra are considered. A computer package called Transversal is developed. This is written in the mathematical language Maple and performs calculations such as those mentioned above and those central to unfolding theory. We discuss the package in detail and give examples of calculations performed in this thesis. Several classifications are obtained. The first is an extensive classification of map-germs (R2,0) -p (R4,0) under A-equivalence. We also consider the classification of function-germs (CP, O) -f (C, 0) under R(D)-equivalence: the restriction of R-equivalence to source coordinate changes which preserve a discriminant variety, D. We consider the cases where D is the discriminant of the A2 and A3 singularities, extending the results of Arnol'd. Several other simple singularities are discussed briefly; in particular, we consider the cases where D is the discriminant of the A4, D4, D5, D6, and Ek singularities. The geometry of the singularities (R2,0) -f (R4,0) is investigated by calculating the adjacencies and several geometrical invariants. For the given source and target dimensions, the invariants associated to the double point schemes and L-codimension of the germs are particularly significant. Finally we give an application of computer graphics to singularity theory. A program is written (in C) which calculates and draws the family of profiles of a surface rotating about a fixed axis in R3, the resulting envelope of profiles, and several other geometrical features. The program was used in recent research by Rycroft. We review some of the results and conclude with computer produced images which demonstrate certain transitions of the singularities on the envelope.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Fatouros, Stavros. "Approximate algebraic computations in control theory." Thesis, City University London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274524.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Heyman, Joseph Lee. "On the Computation of Strategically Equivalent Games." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1561984858706805.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Fukasawa, Ricardo. "Single-row mixed-integer programs : theory and computations /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24660.

Повний текст джерела
Анотація:
Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.
Committee Chair: William J. Cook; Committee Member: Ellis Johnson; Committee Member: George Nemhauser; Committee Member: Robin Thomas; Committee Member: Zonghao Gu
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Computation Theory and Mathematics"

1

Tourlakis, George J. Theory of computation. Hoboken, N.J: Wiley, 2012.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Theory of computation. New York, NY: Wiley, 1987.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Theory of computation. New York: Harper & Row, 1987.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Linear dependence: Theory and computation. New York: Kluwer Academic/Plenum Publishers, 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Multiple criteria optimization: Theory, computation, and application. Malabar, Fla: Krieger, 1989.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Steuer, Ralph E. Multiple criteria optimization: Theory, computation, and application. New York: Wiley, 1986.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

FCT '85 (1985 Cottbus, Germany). Fundamentals of computation theory. Berlin: Springer-Verlag, 1985.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Electromagnetic field theory and computation. Hoboken, N.J: Wiley, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Dasgupta, D. Immunological computation: Theory and applications. Boca Raton: Auerbach Publications, 2009.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Dasgupta, D. Immunological computation: Theory and applications. Boca Raton: Auerbach Publications, 2009.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Computation Theory and Mathematics"

1

Sanders, Sam. "Reverse Mathematics and Computability Theory of Domain Theory." In Logic, Language, Information, and Computation, 550–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-59533-6_33.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Kearfott, R. Baker. "Interval Mathematics Techniques for Control Theory Computations." In Computation and Control, 169–78. Boston, MA: Birkhäuser Boston, 1989. http://dx.doi.org/10.1007/978-1-4612-3704-4_12.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Shparlinski, Igor E. "Finite Fields and Discrete Mathematics." In Finite Fields: Theory and Computation, 265–324. Dordrecht: Springer Netherlands, 1999. http://dx.doi.org/10.1007/978-94-015-9239-0_10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Stewart, Iain A. "On the Mathematics of Data Centre Network Topologies." In Fundamentals of Computation Theory, 283–95. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22177-9_22.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Smale, Stephen. "Theory of computation." In Mathematical Research Today and Tomorrow, 59–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0089205.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Friedman, Avner. "Computation of volume integrals in potential theory." In Mathematics in Industrial Problems, 122–30. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4615-7405-7_12.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Kaltofen, Erich L. "Symbolic Computation and Complexity Theory Transcript of My Talk." In Computer Mathematics, 3–7. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43799-5_1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Peck, Robert W. "Almost Difference Sets in Transformational Music Theory." In Mathematics and Computation in Music, 63–75. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71827-9_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Mazzola, Guerino. "ComMute—Towards a Computational Musical Theory of Everything." In Mathematics and Computation in Music, 21–30. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-21392-3_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Freivalds, RŪsiņš. "Models of Computation, Riemann Hypothesis, and Classical Mathematics." In SOFSEM’ 98: Theory and Practice of Informatics, 89–106. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49477-4_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Computation Theory and Mathematics"

1

Alozn, Ahmad E., and Abdulla Galadari. "Utility function under decision theory: A construction arbitration application." In INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION: Empowering Engineering using Mathematics. Author(s), 2017. http://dx.doi.org/10.1063/1.4994404.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Setiawan, Ekky Kurnia, and I. Ketut Budayasa. "Application of graph theory concept for traffic light control at crossroad." In INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION: Empowering Engineering using Mathematics. Author(s), 2017. http://dx.doi.org/10.1063/1.4994457.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Gibbs, Alison L., and Alex Stringer. "The Fundamental Role of Computation in Teaching Statistical Theory." In IASE 2021 Satellite Conference: Statistics Education in the Era of Data Science. International Association for Statistical Education, 2022. http://dx.doi.org/10.52041/iase.rmcxl.

Повний текст джерела
Анотація:
What skills, knowledge and habits of mind does a statistician require in order to contribute effectively as an inhabitant of the data science ecosystem? We describe a new course in statistical theory that was developed as part of our consideration of this question. The course is a core requirement in a new curriculum for undergraduate students enrolled in statistics programs of study. Problem solving and critical thinking are developed through both mathematical and computational thinking and all ideas are motivated through questions to be answered from large, open and messy data. Central to the development of the course is the tenet that the use of computation is as fundamental to statistical thinking as the use of mathematics. We describe the course, including its connection to the learning outcomes of our new statistics program of study, and the multiple ways we use and integrate computation.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Milasi, Monica, Annamaria Barbagallo, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Preface of Minisymposium “Variational Inequalities and Equilibrium Problems: Existence and Duality Theory and Computation”." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2009: Volume 1 and Volume 2. AIP, 2009. http://dx.doi.org/10.1063/1.3241373.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

M. Bouniaev, Mikhail, and Nikolai P. Dolbilin. "Local Theory of Crystals: Development and Current Status." In Annual International Conference on Computational Mathematics, Computational Geometry & Statistics. Global Science and Technology Forum (GSTF), 2015. http://dx.doi.org/10.5176/2251-1911_cmcgs15.42.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Bethune, Iain. "PrimeGrid: a Volunteer Computing Platform for Number Theory." In Annual International Conference on Computational Mathematics, Computational Geometry & Statistics. Global Science and Technology Forum (GSTF), 2015. http://dx.doi.org/10.5176/2251-1911_cmcgs15.43.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Gale, Ella, Ben De Lacy Costello, and Andrew Adamatzky. "Observation and characterization of memristor current spikes and their application to neuromorphic computation." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756553.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Zhigljavsky, Anatoly, and Vladimir Kornikov. "Classical areas of mathematics where the concept of grossone could be useful." In NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms”. Author(s), 2016. http://dx.doi.org/10.1063/1.4965310.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Khimich, Alexander, Volodymyr Sydoruk, and Pavlo Yershov. "Intellectualization Of Computation Based On Neural Networks For Mathematical Modeling." In 2019 IEEE International Conference on Advanced Trends in Information Theory (ATIT). IEEE, 2019. http://dx.doi.org/10.1109/atit49449.2019.9030444.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

"A Non-lineal Mathematical Model for Annealing Stainless Steel Coils." In International Conference on Neural Computation Theory and Applications. SciTePress - Science and and Technology Publications, 2012. http://dx.doi.org/10.5220/0004112206070610.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Computation Theory and Mathematics"

1

McCarthy, John. Mathematical Theory of Computation. Fort Belvoir, VA: Defense Technical Information Center, August 1991. http://dx.doi.org/10.21236/ada239419.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Yau, Shing-Tung. Mathematics and string theory. Office of Scientific and Technical Information (OSTI), November 2002. http://dx.doi.org/10.2172/809056.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Jaffe, A., and Shing-Tung Yau. [Mathematics and string theory]. Office of Scientific and Technical Information (OSTI), January 1993. http://dx.doi.org/10.2172/6327345.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Jaffe, A., S. Klimek, B. Greene, and S.-T. Yau. (Mathematics and string theory). Office of Scientific and Technical Information (OSTI), January 1989. http://dx.doi.org/10.2172/5148870.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Greenberg, W., and P. Zweifel. Applied mathematics of transport theory. Office of Scientific and Technical Information (OSTI), May 1990. http://dx.doi.org/10.2172/6703991.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Schreiber, Robert, and Beresford Parlett. Block Reflectors: Theory and Computation. Fort Belvoir, VA: Defense Technical Information Center, May 1987. http://dx.doi.org/10.21236/ada206861.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Gidaspow, D. Computation of hydrodynamics using kinetic theory. Office of Scientific and Technical Information (OSTI), December 1991. http://dx.doi.org/10.2172/5686161.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Robinson, Stephen M. Computation and Theory in Nonlinear Optimization. Fort Belvoir, VA: Defense Technical Information Center, April 1996. http://dx.doi.org/10.21236/ada311415.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Hoffman, D. [Geometry, analysis, and computation in mathematics and applied science]. Progress report. Office of Scientific and Technical Information (OSTI), February 1994. http://dx.doi.org/10.2172/218245.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Kusner, R. B., D. A. Hoffman, P. Norman, F. Pedit, N. Whitaker, and D. Oliver. Geometry, analysis, and computation in mathematics and applied sciences. Final report. Office of Scientific and Technical Information (OSTI), December 1995. http://dx.doi.org/10.2172/171332.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Computation Theory and Mathematics" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії