China
Africa
Explore chapters and articles related to this topic
Knowledge amplification by structured expert randomization—KASERs in SoS design
Published in Mo Jamshidi, Systems of Systems Engineering, 2017
Computability theory provides us with a fundamental understanding of the nature of the problem. Rule predicates are recursively enumerable, but not recursive. That is to say that the predicates can only be discovered by search and cannot be functionally characterized. Any search process intrinsically takes time, and that is the fundamental problem underlying the knowledge acquisition bottleneck.
P
Published in Phillip A. Laplante, Dictionary of Computer Science, Engineering, and Technology, 2017
Post’s correspondence problem a problem in computability theory. The problem is stated as L given two sets of strings, find a sequence of words from the first set and a sequence, of the same length, of words from the second set, such that the concatenation of words in the first sequence is the same string as the concatenation of words in the second sequence. This is an undecidable problem.
Replacing Turing Tape with a Fractal Tape
Published in Anirban Bandyopadhyay, Nanobrain, 2020
Higher-order logic in the layered 12 nested universes: the language of primes: In the last century 1905–1937, the syntax of arguments came into being. The culture expanded from the fact that any sequence of events could be split as the sum of the elementary, isolated, discrete sum of events, which are results of logical queries either true or false (predicate logic). Thus, we introduced the sign “equals” to relate input and output (Church’s λ calculus, Kleen’s recursive function theory or computability theory, recursive = computable etc.). Darwin’s definition of evolution where he argued descent with modification is an effort to endless journey to perfection. Water leaks, but how could get a logic leak: The secret of the universal computing concept lies in the philosophy of Turing, where he described brilliantly that the world of information and event is represented as a grid (a piece of paper) made of cells containing discrete events. If we consider a leak in the isolated cells of the grid, the entire adventure of 100 years old computing will fall apart, isolation, pristine identity that gives completeness. All previous attempts to go beyond the Turing kept the grid intact and yet tried to find ways to draw multiple paths between a pair of facts, thus, converted into a Turing machine eventually. A fractal tape only one cell in the grid, but if we enter in that cell we get millions of grids, select and enter inside, then it would open up another grid, and the journey continues, then the concept of first-order logic would not be the answer of a query, “true or false,” preferably a 3D network of truth. In the Turing world, we can write many FOLs using a pen on a piece of paper, torn each piece of paper and arrange them in a line (Turing machine). However, in the new world of FIT, we sit with a piece of paper forever, several new papers exist, but invisible to each other, they grow within and above, each paper has no idea that due to their composition new papers are taking birth. Thus, logic leaks, or nonsense, illogical decisions govern. Turing machine where the solution is restricted to the instructions written in the tape, in fractal tape, it is not. There is no previous and the next step, unlike Marvin machine, every state is a solution to the problem, the solution is delivered perpetually. The system is interactive like a “reactive system,” response to the environment, but as part of the environment, instead of the state transition diagram FTM has a set of PPMs, which is a highly connected 3D network of time crystals and evolves in a lifelike manner.
Determining the most accurate machine learning algorithms for medical diagnosis using the monk’ problems database and statistical measurements
Published in Journal of Experimental & Theoretical Artificial Intelligence, 2023
The main goal of computer science is to design models suitable for computing abilities of computers (Das, 2006). Computability theory in theoretical informatics and mathematics is the branch that deals with how efficiently the questions of a particular calculus model can be solved with an appropriate sequence of commands. This area is divided into three main branches. Automaton theory and language, computability theory and computational complexity theory, which are linked by the question: ‘What are the basic capabilities and limitations of computers?’ (Michael, 2013). Computer science people have come up with a concept called computational model in order to study computing rigorously. This model deals with the mathematical abstraction of computers. There are many different models available, but the most studied is the Turing Machine. Computer science people study this abstract object because it can be formulated in a simple way. It is also easy to investigate. It is also used to prove many results. These are because this object is, as many say, the ‘best fit’ calculation model (Turing, 2020). As a result, computational theory is used in computer science to create structures such as the most appropriate model, compiler, and architecture. For this reason, MLAs created by making the most accurate calculations will give the most accurate result requested from it. Scientists have always strived for their work to be the most accurate. Machine Learning has been developed in computational learning and structure definition studies. These studies are based on a calculation to learn all the complex and nonlinear interactions between variables by minimising the error between predicted and observed results (Dreiseitl & Ohno Machado, 2002). In this study, as well as the logic of computational theory, which is the cornerstone of computer science, three different Monk’ problems databases with distinctive features are used to calculate the most appropriate MLAs. As a result of certain statistical calculations, the most suitable MLA for medical diagnosis was tried to be determined. Detailed information about Monk’ problems database was given in the datasets and features section. In the literature, different studies have been conducted in the field of health to perform the most accurate diagnosis as a result of many calculations.