Relevant bibliographies by topics / Theory of algorithms and mathematical logic

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Theory of algorithms and mathematical logic'

Author: Grafiati
Published: 28 May 2022
Last updated: 30 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Theory of algorithms and mathematical logic.'

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 "Theory of algorithms and mathematical logic"

1

Semenov, A. L., M. A. Babenko, A. Ya Belov, et al. "Chair of Mathematical Logic and Theory of Algorithms." Moscow University Mathematics Bulletin 80, no. 1 (2025): 23–33. https://doi.org/10.3103/s0027132225700196.

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

Uspensky, Vladimir A. "Kolmogorov and mathematical logic." Journal of Symbolic Logic 57, no. 2 (1992): 385–412. http://dx.doi.org/10.2307/2275276.

Full text
Abstract:
There are human beings whose intellectual power exceeds that of ordinary men. In my life, in my personal experience, there were three such men, and one of them was Andrei Nikolaevich Kolmogorov. I was lucky enough to be his immediate pupil. He invited me to be his pupil at the third year of my being student at the Moscow University. This talk is my tribute, my homage to my great teacher.Andrei Nikolaevich Kolmogorov was born on April 25, 1903. He graduated from Moscow University in 1925, finished his post-graduate education at the same University in 1929, and since then without any interruptio
APA, Harvard, Vancouver, ISO, and other styles
3

Zhernovnykova, Oksana, Tamara Deynichenko, Gennadiy Deynychenko, and Oleksandr Chibisov. "Formation of Readiness of Future Mathematics Teachers to Teach Mathematical Logic and Theory of Algorithms." Professional Education: Methodology, Theory and Technologies, no. 16 (November 30, 2022): 90–109. http://dx.doi.org/10.31470/2415-3729-2022-16-90-109.

Full text
Abstract:
The paper is dedicated to the issue of finding ways to increase the efficiency of teaching mathematical logic and the theory of algorithms in pedagogical higher education institutions through the formation of future teachers' professional readiness for teaching the specified type of activity. The purpose of the study was scientific justification and experimental verification of the technology of training students of pedagogical institutions of higher education to study mathematical logic and the theory of algorithms. Methods. During research, a complex of general scientific and special methods
APA, Harvard, Vancouver, ISO, and other styles
4

Moschovakis, Yiannis N. "The formal language of recursion." Journal of Symbolic Logic 54, no. 4 (1989): 1216–52. http://dx.doi.org/10.1017/s0022481200041086.

Full text
Abstract:
This is the first of a sequence of papers in which we will develop a foundation for the theory of computation based on a precise, mathematical notion of abstract algorithm. To understand the aim of this program, one should keep in mind clearly the distinction between an algorithm and the object (typically a function) computed by that algorithm. The theory of computable functions (on the integers and on abstract structures) is obviously relevant to this work, but we will focus on making rigorous and identifying the mathematical properties of the finer (intensional) notion of algorithm.It is cha
APA, Harvard, Vancouver, ISO, and other styles
5

Sinko, Y. I. "INFORMATIONAL-METHODICAL SUPPORT OF THE COURSE «MATHEMATICAL LOGIC AND THEORY OF ALGORITHMS»." Information Technologies in Education, no. 6 (May 31, 2010): 123–29. http://dx.doi.org/10.14308/ite000156.

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

Goncharov, Sergey, and Andrey Nechesov. "Axiomatization of Blockchain Theory." Mathematics 11, no. 13 (2023): 2966. http://dx.doi.org/10.3390/math11132966.

Full text
Abstract:
The increasing use of artificial intelligence algorithms, smart contracts, the internet of things, cryptocurrencies, and digital money highlights the need for secure and sustainable decentralized solutions. Currently, the blockchain technology serves as the backbone for most decentralized systems. However, the question of axiomatization of the blockchain theory in the first-order logic has been open until today, despite the efficient computational implementations of these systems. This did not allow one to formalize the blockchain structure, as well as to model and verify it using logical meth
APA, Harvard, Vancouver, ISO, and other styles
7

Семенов, С. Г., Чжан Ліцзян, Цао Вейлінь, and В. В. Давидов. "Development of protecting a software product mathematical model from unlicensed copying based on the GERT method." Системи обробки інформації, no. 1(164) (March 17, 2021): 73–82. http://dx.doi.org/10.30748/soi.2021.164.08.

Full text
Abstract:
The subject of the research is methods and algorithms for developing the GERT networks that provide a hidden transition along the branches of the control logic graph and the ability to encode digital watermarks in the context of existing threats to the licensing security of software systems. The aim of the work is to develop a system of a software product licensed security based on hidden transition algorithms in GERT networks that carry the properties of digital watermarks. The article solves the following goal: development of a model of a software licensed security system based on the develo
APA, Harvard, Vancouver, ISO, and other styles
8

Nasir, Mohammad, Ali Sadollah, Przemyslaw Grzegorzewski, Jin Hee Yoon, and Zong Woo Geem. "Harmony Search Algorithm and Fuzzy Logic Theory: An Extensive Review from Theory to Applications." Mathematics 9, no. 21 (2021): 2665. http://dx.doi.org/10.3390/math9212665.

Full text
Abstract:
In recent years, many researchers have utilized metaheuristic optimization algorithms along with fuzzy logic theory in their studies for various purposes. The harmony search (HS) algorithm is one of the metaheuristic optimization algorithms that is widely employed in different studies along with fuzzy logic (FL) theory. FL theory is a mathematical approach to expressing uncertainty by applying the conceptualization of fuzziness in a system. This review paper presents an extensive review of published papers based on the combination of HS and FL systems. In this regard, the functional characteri
APA, Harvard, Vancouver, ISO, and other styles
9

KOVALCHUK, GRIGORIY, and AZAT KHISMATULLIN. "DC BOOST CONVERTER USING A FUZZY CONTROL SYSTEM, SIMULATED IN SIMULINK." Computational Nanotechnology 9, no. 4 (2022): 30–34. http://dx.doi.org/10.33693/2313-223x-2022-9-4-30-34.

Full text
Abstract:
Decisive for the operation of voltage, current and power converters is the choice of control method. Control of complex dynamic systems in conditions of insufficient or fuzzy information requires the involvement of non-standard approaches during the construction of the control system. There are two possible ways out of the traditional framework of linear control. The first, is to develop more accurate nonlinear models on which high-performance controller design can be based. However, when choosing this way, one has to develop very complex control algorithms, and, consequently, the controller w
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Xin, Xunxun Xu, Zhijuan Shen, and Mengjun Sun. "Iterative Learning-Based PID Precision Control for Sports Performance Analysis." Wireless Communications and Mobile Computing 2021 (October 26, 2021): 1–13. http://dx.doi.org/10.1155/2021/6404172.

Full text
Abstract:
Traditional function algorithms are contradictory to accuracy and performance. Therefore, taking into account the balance of accuracy and performance, the research of accuracy control-oriented mathematical function algorithms is of great significance to the design of high-precision and high-performance mathematical function algorithms. This paper is aimed at the design of mathematical function algorithm for precision control and has conducted indepth research on traditional PID control algorithm and fuzzy logic control theory. By analyzing the advantages and disadvantages of the two in practic
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Theory of algorithms and mathematical logic"

1

Tabada, Winston M. "An analysis and implementation of linear derivation strategies." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1991. https://ro.ecu.edu.au/theses/1125.

Full text
Abstract:
This study examines the efficacy of six linear derivation strategies: (i) s-linear resolution, (ii) the ME procedure; (iii) t-linear resolution, (iv) SL -resolution, (v) the GC procedure, and (vi) SLM. The analysis is focused on the different restrictions and operations employed in each derivation strategy. The selection function, restrictive ancestor resolution, compulsory ancestor resolution on literals having atoms which are or become identical, compulsory merging operations, reuse of truncated literals, spreading of FALSE literals, no-tautologies resection, no two non-B-literals having ide
APA, Harvard, Vancouver, ISO, and other styles
2

Verga, Juliana 1984. "Algoritmos para redes de transporte multimodal aplicado ao tráfego urbano." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260596.

Full text
Abstract:
Orientadores: Akebo Yamakami, Ricardo Coelho Silva<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-25T08:18:04Z (GMT). No. of bitstreams: 1 Verga_Juliana_D.pdf: 1085866 bytes, checksum: 6325aac2b413dfa3fc773ecc3791388c (MD5) Previous issue date: 2014<br>Resumo: A teoria de grafos é comumente utilizada na área da engenharia para resolver problemas que podem ser representados na forma de redes. Dentre diversos problemas abordados, o problema de transporte multimodal é um dos que podem ser modelados
APA, Harvard, Vancouver, ISO, and other styles
3

Ho, Hsi-Ming. "Topics in monitoring and planning for embedded real-time systems." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:f507756d-8bdc-4b1f-8bbf-214c9997f9c5.

Full text
Abstract:
The verification of real-time systems has gained much interest in the formal verification community during the past two decades. In this thesis, we investigate two real-time verification problems that benefit from the techniques normally used in untimed verification. The first part of this thesis is concerned with the monitoring of real-time specifications. We study the expressiveness of metric temporal logics over timed words, a problem that dates back to early 1990s. We show that the logic obtained by extending Metric Temporal Logic (MTL) with two families of new modalities is expressively c
APA, Harvard, Vancouver, ISO, and other styles
4

Жовтя, Є. М. "Використання Flash-технології для активізації навчання з курсу "Теорія алгоритмів та матлогіка"". Thesis, Видавництво СумДУ, 2011. http://essuir.sumdu.edu.ua/handle/123456789/9872.

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

Bundala, Daniel. "Algorithmic verification problems in automata-theoretic settings." Thesis, University of Oxford, 2014. https://ora.ox.ac.uk/objects/uuid:60b2d507-153f-4119-a888-56ccd47c3752.

Full text
Abstract:
Problems in formal verification are often stated in terms of finite automata and extensions thereof. In this thesis we investigate several such algorithmic problems. In the first part of the thesis we develop a theory of completeness thresholds in Bounded Model Checking. A completeness threshold for a given model M and a specification &phi; is a bound k such that, if no counterexample to &phi; of length k or less can be found in M, then M in fact satisfies &phi;. We settle a problem of Kroening et al. [KOS<sup>+</sup>11] in the affirmative, by showing that the linearity problem for both regula
APA, Harvard, Vancouver, ISO, and other styles
6

Merry, Alexander. "Reasoning with !-graphs." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:416c2e6d-2932-4220-8506-50e6b403b660.

Full text
Abstract:
The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can be built on this to allow the formalisation of inductive proofs in the string diagrams of compact closed and traced symmetric monoidal categories. String diagrams provide an intuitive method for reasoning about monoidal categories. However, this does not negate the ability for those using them to make mistakes in proofs. To this end, there is a project (Quan
APA, Harvard, Vancouver, ISO, and other styles
7

Hague, Matthew. "Saturation methods for global model-checking pushdown systems." Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76.

Full text
Abstract:
Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Model-checking for pushdown systems has been well-studied. Tools implementing pushdown model-checking (e.g. Moped) are an essential back-end component of high-profile software model checkers such as SLAM, Blast and Terminator. Higher-order pushdown systems define a more complex memory structure: a higher-order stack is a stack of lower-order stacks. These systems form a robust h
APA, Harvard, Vancouver, ISO, and other styles
8

Thompson, Benjamin Criveli. "A mathematical theory of synchronous concurrent algorithms." Thesis, University of Leeds, 1987. http://etheses.whiterose.ac.uk/945/.

Full text
Abstract:
A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock. Synchronous algorithms include systolic algorithms; these are algorithms that are well-suited to implementation in VLSI technologies. This thesis provides a mathematical theory for the design and analysis of synchronous algorithms. The theory includes the formal specification of synchronous algorithms; techniques for proving the correctness and performance or time-complexity of synchronous algorith
APA, Harvard, Vancouver, ISO, and other styles
9

Donafee, Andrea. "Picture theory : algorithms and software." Thesis, University of Bedfordshire, 2003. http://hdl.handle.net/10547/305728.

Full text
Abstract:
This thesis is concerned with developing and implementing algorithms based upon the geometry of pictures. Spherical pictures have been used in many areas of combinatorial group theory, and particularly, they have shown to be a useful method when studying the second homotopy module, 1T2, of a presentation ([3],[4],[7],[12],[41] and [64]). Computational programs that implement picture theoretical and design algorithms could advance the areas in which picture theory can be used, due to the much faster time taken to derive results than that of manual calculations. A variety of algorithms are prese
APA, Harvard, Vancouver, ISO, and other styles
10

Yim, Austin Vincent. "On Galois correspondences in formal logic." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97.

Full text
Abstract:
This thesis examines two approaches to Galois correspondences in formal logic. A standard result of classical first-order model theory is the observation that models of L-theories with a weak form of elimination of imaginaries hold a correspondence between their substructures and automorphism groups defined on them. This work applies the resultant framework to explore the practical consequences of a model-theoretic Galois theory with respect to certain first-order L-theories. The framework is also used to motivate an examination of its underlying model-theoretic foundations. The model-theoreti
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Theory of algorithms and mathematical logic"

1

Uspensky, Vladimir. Algorithms: Main Ideas and Applications. Springer Netherlands, 1993.

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

Lavrov, Igor, and Larisa Maksimova. Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. Edited by Giovanna Corsi. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0185-5.

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

service), SpringerLink (Online, ed. Proofs and Algorithms: An Introduction to Logic and Computability. Springer-Verlag London Limited, 2011.

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

Sturmfels, Bernd. Algorithms in invariant theory. 2nd ed. Springer, 2008.

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

1939-, Kohlas Jürg, and Moral Serafín 1952-, eds. Algorithms for uncertainty and defeasible reasoning. Kluwer Academic Publishers, 2000.

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

Kohlas, Jürg. Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for Uncertainty and Defeasible Reasoning. Springer Netherlands, 2000.

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

Maslov, S. I͡U. Teorii͡a deduktivnykh sistem i ee primenenii͡a. "Radio i svi͡azʹ", 1986.

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

Maslov, S. I͡U. Theory of deductive systems and its applications. MIT Press, 1987.

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

McGuire, Hugh W. Two methods for checking formulas of temporal logic. Dept. of Computer Science, Stanford University, 1995.

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

1945-, Gabbay Dov M., and Smets Philippe, eds. Handbook of defeasible reasoning and uncertainty management systems. Kluwer, 1998.

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

Book chapters on the topic "Theory of algorithms and mathematical logic"

1

Lavrov, Igor, Larisa Maksimova, and Giovanna Corsi. "Mathematical logic." In Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0185-5_2.

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

Lavrov, Igor, Larisa Maksimova, and Giovanna Corsi. "Mathematical logic." In Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0185-5_5.

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

Lavrov, Igor, Larisa Maksimova, and Giovanna Corsi. "Theory of algorithms." In Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0185-5_3.

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

Lavrov, Igor, Larisa Maksimova, and Giovanna Corsi. "Theory of algorithms." In Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0185-5_6.

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

Lavrov, Igor, Larisa Maksimova, and Giovanna Corsi. "Set theory." In Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0185-5_1.

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

Lavrov, Igor, Larisa Maksimova, and Giovanna Corsi. "Set theory." In Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0185-5_4.

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

Aliferis, Constantin, and Gyorgy Simon. "Foundations and Properties of AI/ML Systems." In Health Informatics. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-39355-6_2.

Full text
Abstract:
AbstractThe chapter provides a broad introduction to the foundations of health AI and ML systems and is organized as follows: (1) Theoretical properties and formal vs. heuristic systems: computability, incompleteness theorem, space and time complexity, exact vs. asymptotic complexity, complexity classes and how to establish complexity of problems even in the absence of known algorithms that solve them, problem complexity vs. algorithm and program complexity, and various other properties. Moreover, we discuss the practical implications of complexity for system tractability, the folly of expecti
APA, Harvard, Vancouver, ISO, and other styles
8

Kashkevich, Svitlana, Oleksiy Buyalo, Olha Matsyi, Anastasiia Voznytsia, Daniil Krant, and Kostiantin Radchenko. "Scientific and methodological apparatus for processing diverse data in automated control systems." In DECISION SUPPORT SYSTEMS: MATHEMATICAL SUPPORT. TECHNOLOGY CENTER PC, 2025. https://doi.org/10.15587/978-617-8360-13-9.ch4.

Full text
Abstract:
This section of the study proposes the conceptual foundations for the use of artificial intelligence in intelligent decision support systems. In the course of the research, the authors:– justified the feasibility of using artificial intelligence theory for processing heterogeneous data in automated control systems;– developed a methodology for data distribution in automated control systems;– designed a model for evaluating the process of heterogeneous data processing in automated troop control systems using expert information;– improved the methodology for configuring an information system to
APA, Harvard, Vancouver, ISO, and other styles
9

Kossak, Roman. "Set Theory." In Mathematical Logic. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-97298-5_6.

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

Csirmaz, Laszlo, and Zalán Gyenis. "Recursion Theory." In Mathematical Logic. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-79010-3_4.

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

Conference papers on the topic "Theory of algorithms and mathematical logic"

1

Young, Lisa M., Peter L. Andresen, and Thomas M. Angeliu. "Crack Tip Strain Rate: Estimates Based on Continuum Theory and Experimental Measurement." In CORROSION 2001. NACE International, 2001. https://doi.org/10.5006/c2001-01131.

Full text
Abstract:
Abstract This ongoing research seeks to improve stress corrosion cracking (SCC) life prediction methodology by developing a fundamentally-based crack tip strain rate equation for use in SCC crack growth rate algorithms. The time-based mathematical derivative of a continuum mechanics equation for crack tip strain ahead of a nonstationary crack in a work hardening material is used to formulate a crack tip strain rate expression. The resulting expression allows determination of the effect of material properties and loading parameters, such as yield strength and stress intensity factor, on crack t
APA, Harvard, Vancouver, ISO, and other styles
2

Epishkina, Anna, Konstantin Kogos, and Natalia Nikiforova. "A course of Mathematical Logic and Theory of Algorithms as a mathematical background of modern cryptology." In 2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC). IEEE, 2016. http://dx.doi.org/10.1109/dipdmwc.2016.7529389.

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

Huang, Kung-Shiuh, B. K. Jenkins, and A. A. Sawchuk. "Binary image algebra representations of optical cellular logic and symbolic substitution." In OSA Annual Meeting. Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.tha4.

Full text
Abstract:
Binary image algebra (BIA) provides a systematic mathematical formalism for both digital optical cellular logic and symbolic substitution processors, in addition to being a unified theory of parallel binary image processing.1 Cellular logic operations and symbolic substitution rules are proved to be special cases of image transformations in BIA; and BIA serves as an algebraic theory for developing and analyzing parallel algorithms of both cellular logic and symbolic substitution.
APA, Harvard, Vancouver, ISO, and other styles
4

A. N., Rybalov. "GENERIC COMPLEXITY OF ALGORITHMIC PROBLEMS." In Mechanical Science and Technology Update. Omsk State Technical University, 2022. http://dx.doi.org/10.25206/978-5-8149-3453-6-2022-10-14.

Full text
Abstract:
Generic approach is one of the approaches to the study of algorithmic problems for almost all inputs, born at the intersection of computational algebra and computer science. Within the framework of this approach, algorithms are studied that solve a problem for almost all inputs, and for the remaining rare inputs give an undefined answer. This review reflects two areas of research of generic complexity of algorithmic problems in algebra, mathematical logic, number theory, and theoretical computer science. The first direction is devoted to the construction of generic algorithms for problems that
APA, Harvard, Vancouver, ISO, and other styles
5

Cruse, Thomas A. "Advances in Probabilistic Methods." In ASME 2000 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/imece2000-2668.

Full text
Abstract:
Abstract Advances in probabilistic methods to support the design of mechanical systems is now moving to the engineering desktop. Basic modeling strategies are understood and in use in many applications. There are still issues to be resolved in the application of these methods to reliability critical applications. Some of these issues will be highlighted. At the same time, the design of complex aerospace systems requires more than just probabilistic methods as we know them now. The presentation will review a recent study by its author on the development and application of non-traditional and no
APA, Harvard, Vancouver, ISO, and other styles
6

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

Voytsekhovich, Vyacheslav Emerikovich. "Mathematics of the future." In 4th International Conference “Futurity designing. Digital reality problems”. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/future-2021-8.

Full text
Abstract:
Mathematics has entered a crisis of complexity. The main reason is the use of immutable concepts according to the law of identity of Aristotle's logic. The evidence has become super-long, unverifiable. Overcoming the crisis is possible in the transition from immutable concepts to "mobile" ones, in the generalization of the law of identity. In modern mathematics, there are prerequisites for such a transition – in qualitative theory, probability theory, algorithm theory, and foundations. The future of mathematics lies in the development of categories as transformative concepts.
APA, Harvard, Vancouver, ISO, and other styles
8

Buchberger, Bruno. "Mathematical Theory Exploration." In 2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE, 2006. http://dx.doi.org/10.1109/synasc.2006.50.

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

Chirila, Ciprianbogdan. "EDUCATIONAL RESOURCES AS WEB GAME FRAMEWORKS FOR PRIMARY AND MIDDLE SCHOOL STUDENTS." In eLSE 2014. Editura Universitatii Nationale de Aparare "Carol I", 2014. http://dx.doi.org/10.12753/2066-026x-14-029.

Full text
Abstract:
The massive open online course is a development in distance education. The existing online courses for primary and middle school students are based on several classic open educational resources like images, sounds, animations, but they could also be based on competence achieving web games. Writing web games for each discipline competence is a hard task, achievable only by programmers. Using frameworks we can offer teachers and other content editors the possibility of creating their own web games for the students. In this sense we designed and implemented two frameworks. One framework is based
APA, Harvard, Vancouver, ISO, and other styles
10

Sussmann. "The mathematical theory of learning algorithms for Boltzmann machines." In International Joint Conference on Neural Networks. IEEE, 1989. http://dx.doi.org/10.1109/ijcnn.1989.118278.

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

Reports on the topic "Theory of algorithms and mathematical logic"

1

Prokaznikova, E. N. The distance learning course «The Mathematical Logic and Theory of Algorithms». OFERNIO, 2018. http://dx.doi.org/10.12731/ofernio.2018.23531.

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

Klema, V. Numerical Algorithms and Mathematical Software for Linear Control and Estimation Theory. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada157525.

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

Muller, L., G. Yang, and V. Comalino. Integrability in Constructive K-Theory mathematical model for operation algorithms of an airship anti-stealth radar. Web of Open Science, 2020. http://dx.doi.org/10.37686/ser.v1i1.2.

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

Pasupuleti, Murali Krishna. Quantum Cognition: Modeling Decision-Making with Quantum Theory. National Education Services, 2025. https://doi.org/10.62311/nesx/rrvi225.

Full text
Abstract:
Abstract Quantum cognition applies quantum probability theory and mathematical principles from quantum mechanics to model human decision-making, reasoning, and cognitive processes beyond the constraints of classical probability models. Traditional decision theories, such as expected utility theory and Bayesian inference, struggle to explain context-dependent reasoning, preference reversals, order effects, and cognitive biases observed in human behavior. By incorporating superposition, interference, and entanglement, quantum cognitive models offer a probabilistic framework that better accounts
APA, Harvard, Vancouver, ISO, and other styles
5

Baader, Franz, and Felix Distel. A finite basis for the set of EL-implications holding in a finite model. Technische Universität Dresden, 2007. http://dx.doi.org/10.25368/2022.160.

Full text
Abstract:
Formal Concept Analysis (FCA) can be used to analyze data given in the form of a formal context. In particular, FCA provides efficient algorithms for computing a minimal basis of the implications holding in the context. In this paper, we extend classical FCA by considering data that are represented by relational structures rather than formal contexts, and by replacing atomic attributes by complex formulae defined in some logic. After generalizing some of the FCA theory to this more general form of contexts, we instantiate the general framework with attributes defined in the Description Logic (
APA, Harvard, Vancouver, ISO, and other styles
6

Striuk, Andrii M. Software engineering: first 50 years of formation and development. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2880.

Full text
Abstract:
The article analyzes the main stages of software engineering (SE) development. Based on the analysis of materials from the first SE conferences (1968-1969), it was determined how the software crisis prompted scientists and practitioners to join forces to form an engineering approach to programming. Differences in professional training for SE are identified. The fundamental components of the training of future software engineers are highlighted. The evolution of approaches to the design, implementation, testing and documentation of software is considered. The system scientific, technological ap
APA, Harvard, Vancouver, ISO, and other styles
7

Hrebeniuk, Bohdan V. Modification of the analytical gamma-algorithm for the flat layout of the graph. [б. в.], 2018. http://dx.doi.org/10.31812/123456789/2882.

Full text
Abstract:
The planarity of graphs is one of the key sections of graph theory. Although a graph is an abstract mathematical object, most often it is graph visualization that makes it easier to study or develop in a particular area, for example, the infrastructure of a city, a company’s management or a website’s web page. In general, in the form of a graph, it is possible to depict any structures that have connections between the elements. But often such structures grow to such dimensions that it is difficult to determine whether it is possible to represent them on a plane without intersecting the bonds.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Theory of algorithms and mathematical logic' 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