Relevant bibliographies by topics / 080200 Computation Theory and Mathematics

Academic literature on the topic '080200 Computation Theory and Mathematics'

Author: Grafiati
Published: 10 December 2022
Last updated: 29 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic '080200 Computation Theory and Mathematics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "080200 Computation Theory and Mathematics"

1

Simos, T. E. "On the Explicit Four-Step Methods with Vanished Phase-Lag and its First Derivative." Applied Mathematics & Information Sciences 8, no. 2 (March 1, 2014): 447–58. http://dx.doi.org/10.12785/amis/080201.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Srdjevic, Bojan, Zorica Srdjevic, and Bosko Blagojevic. "First-Level Transitivity Rule Method for Filling in Incomplete Pair-Wise Comparison Matrices in the Analytic Hierarchy Process." Applied Mathematics & Information Sciences 8, no. 2 (March 1, 2014): 459–67. http://dx.doi.org/10.12785/amis/080202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Razborova, Polina, Bouthina Ahmed, and Anjan Biswas. "Solitons, Shock Waves and Conservation Laws of Rosenau-KdV-RLW Equation with Power Law Nonlinearity." Applied Mathematics & Information Sciences 8, no. 2 (March 1, 2014): 485–91. http://dx.doi.org/10.12785/amis/080205.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:
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, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "080200 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/.

Full text
Abstract:
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, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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/.

Full text
Abstract:
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, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Engdahl, Erik. "Computation of resonance energies and spectral densities in the complex energy plane : application of complex scaling techniques for atoms, molecules and surfaces /." Uppsala : Uppsala Universitet, 1988. http://bibpurl.oclc.org/web/32938.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Whaley, Dewey Lonzo. "The Interquartile Range: Theory and Estimation." Digital Commons @ East Tennessee State University, 2005. https://dc.etsu.edu/etd/1030.

Full text
Abstract:
The interquartile range (IQR) is used to describe the spread of a distribution. In an introductory statistics course, the IQR might be introduced as simply the “range within which the middle half of the data points lie.” In other words, it is the distance between the two quartiles, IQR = Q3 - Q1. We will compute the population IQR, the expected value, and the variance of the sample IQR for various continuous distributions. In addition, a bootstrap confidence interval for the population IQR will be evaluated.
APA, Harvard, Vancouver, ISO, and other styles
10

Tung, Jen-Fu. "An Algorithm to Generate Two-Dimensional Drawings of Conway Algebraic Knots." TopSCHOLAR®, 2010. http://digitalcommons.wku.edu/theses/163.

Full text
Abstract:
The problem of finding an efficient algorithm to create a two-dimensional embedding of a knot diagram is not an easy one. Typically, knots with a large number of crossings will not nicely generate two-dimensional drawings. This thesis presents an efficient algorithm to generate a knot and to create a nice two-dimensional embedding of the knot. For the purpose of this thesis a drawing is “nice” if the number of tangles in the diagram consisting of half-twists is minimal. More specifically, the algorithm generates prime, alternating Conway algebraic knots in O(n) time where n is the number of crossings in the knot, and it derives a precise representation of the knot’s nice drawing in O(n) time (The rendering of the drawing is not O(n).). Central to the algorithm is a special type of rooted binary tree which represents a distinct prime, alternating Conway algebraic knot. Each leaf in the tree represents a crossing in the knot. The algorithm first generates the tree and then modifies such a tree repeatedly to reduce the number of its leaves while ensuring that the knot type associated with the tree is not modified. The result of the algorithm is a tree (for the knot) with a minimum number of leaves. This minimum tree is the basis of deriving a 4-regular plane map which represents the knot embedding and to finally draw the knot’s diagram.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "080200 Computation Theory and Mathematics"

1

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jin, Jian-Ming. Theory and computation of electromagnetic fields. Hoboken, N.J: Wiley, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Higham, Nicholas J. Functions of matrices: Theory and computation. Philadelphia: Society for Industrial and Applied Mathematics, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "080200 Computation Theory and Mathematics"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Žabka, Marek. "Introduction to Scale Theory over Words in Two Dimensions." In Mathematics and Computation in Music, 311–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21590-2_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Arias, Juan Sebastián. "Abstract Gestures: A Unifying Concept in Mathematical Music Theory." In Mathematics and Computation in Music, 183–200. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71827-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "080200 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
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, and other styles
5

Brackett, Robert. "Architecture Revisits Math & Science: Computation in a Visual Thinking Pedagogy." In Schools of Thought Conference. University of Oklahoma, 2020. http://dx.doi.org/10.15763/11244/335059.

Full text
Abstract:
This paper makes a case for the greater integration of computational logic and principles in core undergraduate architectural design courses as visual thinking pedagogy. Math and computation present abstract problems that may seem at odds with the real-world design concepts with which students are familiar. Because architecture students are typically strong visual thinkers, abstract mathematical language can be difficult to learn, but these concepts can be used as a pedagogical interface to support visual problem-solving in the design process. Building on the work of Christopher Alexander in Notes on the Synthesis of Form and A Pattern Language, the idea of “pattern languages” can be used to develop a curriculum that relies on math and computation to connect the visual and social systems at work in the design process. Design curricula can integrate computational thinking based on vector math, geometry, calculus, matrices, set theory, visual programming, and scripting to build students’ computational literacy through visual problem-solving. George Stiny’s “shape grammars” offer an intuitive analog method for introducing students to computational thinking through elements and rules in preparation for designing with digital tools. The further we distance ourselves from the fundamental operations of mathematics and computation, the more we risk becoming obsolete in the process. Computer programs can automate modeling, analyzing, programming, reviewing, and even designing buildings. For now, that places the architect in a narrow domain of design and visual aesthetics, which will quickly be subsumed by machine algorithms deployed by software companies. These machine constructions operate at the social/cultural scale, a place suited for the critical position and service of architects. The education of an architect should therefore provide students with critical knowledge and skills that position them to define the parameters of automation and challenge the computer programmers with radical ideas, communicated in a shared language of mathematics that is both visual and abstract.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic '080200 Computation Theory and Mathematics' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography