Computational Theory Research Articles

БАЗОВЫЕ ТЕХНОЛОГИИ, РЕКОМЕНДУЕМЫЕ ДЛЯ ИСПОЛЬЗОВАНИЯ В ХОДЕ СТРАТЕГИЧЕСКОГО ПЛАНИРОВАНИЯ ПРОМЫШЛЕННЫХ ПРЕДПРИЯТИЙ

Strategic planning of industrial enterprises is carried out in conditions of significant infor-mation uncertainty regarding the external conditions of the enterprise's functioning and its positioning in its industry environment, in order to ensure effective competition. Therefore, it is necessary to develop new approaches to strategic planning of enterprises in conditions of uncertainty. The aim of the study is to present a number of new basic technologies that are advisable to use in the course of strategic planning of industrial enterprises based on the application of fuzzy set theory and soft computing. The following basic technologies are analyzed in the article: analysis of industry anisotropy; application of matrix aggregate calculator (MAС) technology to assess economic resilience; fuzzy numerical interpretation of the «scarlet» and «blue» market oceans; strategic positioning of the enterprise in the «resili-ence – efficiency» space; predictive modeling of activity levels based on probability processes; assessment of the risk of non-fulfillment of the plan according to strategic indicators. All the basic technologies described in the work are recommended for implementation in standard processes of strategic planning and forecasting of industrial enterprises. Such an application will ensure that the planning procedure is consistent with the expressed strategic goals of the business owner. The study is original, it uses methods of fuzzy set theory and soft computing. A new technology for analyzing industry anisotropy based on R-lens clustering is proposed, as well as a method for predicting performance levels based on probability processes.

Editor's Introduction: Best Papers from the 20th International Conference on Cognitive Modeling.

The International Conference on Cognitive Modelling is dedicated to understanding how the complex processes of the mind can be explained in terms of detailed inner processing. In this issue, we present four representative papers of this field of research from our 20th meeting, ICCM 2022. This meeting was our first hybrid meeting, with a virtual version happening July 11-15, 2022, and an in-person event from July 23-27, 2022, held in Toronto, Canada. The four papers presented here were the top-ranked papers across both the virtual and in-person events. Three of the papers develop novel computational theories about low-level components within the mind and how those components result in high-level phenomena such as motivation, anhedonia, and attention. The final paper demonstrates the use of cognitive modeling to develop novel explanations of a paired associate learning task, and uses those insights to develop and explain human performance in a more complex version of that task.

Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective

Milliken’s tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey’s theorem and its many variants and consequences. In this sense, Milliken’s tree theorem is paradigmatic of structural Ramsey theory, which seeks to identify the common combinatorial and logical features of partition results in general. Its investigation in this area has consequently been extensive. Motivated by a question of Dobrinen, we initiate the study of Milliken’s tree theorem from the point of view of computability theory. The goal is to understand how close it is to being algorithmically solvable, and how computationally complex are the constructions needed to prove it. This kind of examination enjoys a long and rich history, and continues to be a highly active endeavor. Applied to combinatorial principles, particularly Ramsey’s theorem, it constitutes one of the most fruitful research programs in computability theory as a whole. The challenge to studying Milliken’s tree theorem using this framework is its unusually intricate proof, and more specifically, the proof of the Halpern-Laüchli theorem, which is a key ingredient. Our advance here stems from a careful analysis of the Halpern-Laüchli theorem which shows that it can be carried out effectively (i.e., that it is computably true). We use this as the basis of a new inductive proof of Milliken’s tree theorem that permits us to gauge its effectivity in turn. The key combinatorial tool we develop for the inductive step is a fast-growing computable function that can be used to obtain a finitary, or localized, version of Milliken’s tree theorem. This enables us to build solutions to the full Milliken’s tree theorem using effective forcing. The principal result of this is a full classification of the computable content of Milliken’s tree theorem in terms of the jump hierarchy, stratified by the size of instance. As usual, this also translates into the parlance of reverse mathematics, yielding a complete understanding of the fragment of second-order arithmetic required to prove Milliken’s tree theorem. We apply our analysis also to several well-known applications of Milliken’s tree theorem, namely Devlin’s theorem, a partition theorem for Rado graphs, and a generalized version of the so-called tree theorem of Chubb, Hirst, and McNicholl. These are all certain kinds of extensions of Ramsey’s theorem for different structures, namely the rational numbers, the Rado graph, and perfect binary trees, respectively. We obtain a number of new results about how these principles relate to Milliken’s tree theorem and to each other, in terms of both their computability-theoretic and combinatorial aspects. In particular, we establish new structural Ramsey-theoretic properties of the Rado graph theorem and the generalized Chubb-Hirst-McNicholl tree theorem using Zucker’s notion of big Ramsey structure.

Affective Computing: Recent Advances, Challenges, and Future Trends

Affective computing is a rapidly growing multidisciplinary field that encompasses computer science, engineering, psychology, neuroscience, and other related disciplines. Although the literature in this field has progressively grown and matured, the lack of a comprehensive bibliometric analysis limits the overall understanding of the theory, technical methods, and applications of affective computing. This review presents a quantitative analysis of 33,448 articles published in the period from 1997 to 2023, identifying challenges, calling attention to 10 technology trends, and outlining a blueprint for future applications. The findings reveal that the emerging forces represented by China and India are transforming the global research landscape in affective computing, injecting transformative power and fostering extensive collaborations, while emphasizing the need for more consensus regarding standard setting and ethical norms. The 5 core research themes identified via cluster analysis not only represent key areas of international interest but also indicate new research frontiers. Important trends in affective computing include the establishment of large-scale datasets, the use of both data and knowledge to drive innovation, fine-grained sentiment classification, and multimodal fusion, among others. Amid rapid iteration and technology upgrades, affective computing has great application prospects in fields such as brain–computer interfaces, empathic human–computer dialogue, assisted decision-making, and virtual reality.

АНАЛИЗ ОТРАСЛЕВОЙ АНИЗОТРОПИИ В МЕЖДУНАРОДНОМ МАШИНОСТРОЕНИИ

Industry anisotropy, including in international mechanical engineering, is a poorly studied property of the industry system. At the same time, it is anisotropy that determines the nature of intra-industry competition. The aim of the study is to propose an approach for the analysis of industry anisotropy in the coordinate space “ resilience – efficiency” where a two–petalled R-lens will be formed, which is then clustered, with the allocation of seven reference clusters. The inclusion of such enterprise image points in one of the six selected clusters allows companies from the industry to assess their location, nearest competitors, risks, and methods of repositioning (if applicable). The study is original, it uses methods of fuzzy set theory and soft computing. A new technology for analyzing industry anisotropy based on clustering of R-lenses is proposed.

A label free fluorescent aptamer sensor based on the combined action of Graphene oxide and SYBR Green I for the detection of Aflatoxin B1.

Here, based on the characteristics of Graphene oxide(GO) and SYBR Green I(SGI) dye, an enzyme-free and label-free fluorescent biosensor with signal amplification through DNA strand reaction is proposed for the detection of Aflatoxin B1(AFB1) in food safety. Firstly, without the addition of AFB1, the substrate in the system includes a double stranded Apt-S with a long sticky end and two hairpins H1 and H2. Although the complementary pairing of bases may exhibit fluorescence due to the insertion of SGI dyes, the use of GO, which is highly capable of adsorbing single stranded parts and quenching fluorescence, cleverly reduces the background fluorescence. Adding the target AFB1 triggers DNA inter chain reactions, generating a large amount of long double stranded DNA H1-H2, thereby generating strong fluorescence signals under the action of SGI. More importantly, logical theory verification and computer simulation were conducted before biological experiments, providing a theoretical basis for the implementation of the biosensor. After analysis, the fluorescence biosensor exhibits a good linear relationship with AFB1 concentration in the range of 5-50nM, with a detection limit of 0.76nM. It also has good specificity, anti-interference ability, and practical application ability, and has broad application prospects in the field of food safety.

Mind and Machine: A Philosophical Examination of Matt Carter’s “Minds & Computers: An Introduction to the Philosophy of Artificial Intelligence”

In his book “Minds and Computers: An Introduction to the Philosophy of Artificial Intelligence”, Matt Carter presents a comprehensive exploration of the philosophical questions surrounding artificial intelligence (AI). Carter argues that the development of AI is not merely a technological challenge but fundamentally a philosophical one. He delves into key issues like the nature of mental states, the limits of introspection, the implications of memory decay, and the functionalist framework that allows for the possibility of AI. Carter contrasts functionalism with reductive materialism, highlighting how the former accommodates the concept of artificial minds. He also emphasizes the significance of computationalism, which combines functionalism with computational theory to provide a robust explanation for mental processes. The book further discusses formal systems, the role of register machines in computation, and the inherent challenges in AI research, particularly in developing natural languag processing systems. Carter’s work underscores the limitations of current computational models of cognition while remaining hopeful that advances in neuroscience may lead to stronger AI systems in the future. This book provides critical insights for researchers in AI and cognitive science, motivating further inquiry into the philosophical foundations of artificial intelligence and its practical implications.

A detailed study on implementing new approaches in the Game of Life

In 1952, Alan Turing who is considered as a father of Computer Science, based on his previous scientific research on the theory of computation, he emphasized how important is the analysis of pattern formation in nature and developed a theory. In his theory, he described specific patterns in nature that could be formed from basic chemical systems. Turing in his previous studies in the theory of computation, he had constantly worked on symmetrical patterns that could be formed simultaneously and realized the necessity for further analysis of pattern formation in biological problems. However, it was until the late 1960s, when John Conway was the first to introduce the "Game of Life", an innovative mathematical game based on cellular automata, having a purpose to utilize the fundamental entities, called as cells, in two possible states described as "dead" or "alive". This paper tries to contribute to a better understanding of the "Game of Life" by implementing algorithmic approaches of this problem in PASCAL and Python programming languages. Also, inside the paper numerous variations and extensions of the Conway's Game of Life are proposed that introduce new ideas and concepts. Furthermore, several machine learning algorithms to learn patterns from large sets of Game of Life simulations and generate new rules or strategies are described in detail.

Practice-oriented training of future Computer Science teachers

The article reveals the purpose of practical work on the methods of teaching Computer Science, investigates their place in the curriculum, the processes of their organization during the professional training of students in the educational and professional program "Secondary Education (Computer Science)". General secondary education institutions need a Computer Science teacher who has active knowledge of computer science and methods of teaching it, the ability to organize and effectively implement the educational process, alongside the willingness to develop as a person and as a specialist. Theoretical, empirical, and statistical research methods are used. Practice-oriented training combines educational and cognitive, professional and practical, research- and development-centred activities, solving pedagogical situations and methodological problems, integrating the knowledge of computer science, pedagogy, psychology, theory and methods of teaching. An important place in solving this problem is occupied by laboratory and practical work within the discipline "Methods of teaching computer science", which are defined as forms of organization of education in higher education institutions and as methods of professional training aimed at future teachers of Computer Science. The purpose of these forms of education is to train teachers who are able to: perform methodological activities in the design, organization and implementation of the educational process in Computer Science; use forms, means, methods and techniques of teaching students appropriately; develop author's educational and didactic materials for curricula and model programs; develop comprehensively. The conditions for effective practice-oriented training are the reproduction of the process of performing professional duties by a teacher, the use of active teaching methods, as well as the cooperation of the subjects of the educational process. The prospect is to find effective methods of involving students in modelling the professional actions of a teacher, developing methodological cases.

The evolution of the concept of time in modern physics

The main object of this article is to contribute to a synthesis study of the notion of time through the physical theories. In detail, we focus on the evolution of the concept of time from Newton's classical theory to various modern theories such as relativity and quantum mechanics and more modern ones such as string theory and quantum computing. We are also interested in the notion of the arrow of time, which according to thermodynamic principles cannot be reversed. However, in the context of quantum computing, we show an interesting work in which it has been demonstrated that one can reverse the arrow of time.

Enhancing Data Freshness in Air-Ground Collaborative Heterogeneous Networks through Contract Theory and Generative Diffusion-Based Mobile Edge Computing.

Mobile edge computing is critical for improving the user experience of latency-sensitive and freshness-based applications. This paper provides insights into the potential of non-orthogonal multiple access (NOMA) convergence with heterogeneous air-ground collaborative networks to improve system throughput and spectral efficiency. Coordinated resource allocation between UAVs and MEC servers, especially in the NOMA framework, is addressed as a key challenge. Under the unrealistic assumption that edge nodes contribute resources indiscriminately, we introduce a two-stage incentive mechanism. The model is based on contract theory and aims at optimizing the utility of the service provider (SP) under the constraints of individual rationality (IR) and incentive compatibility (IC) of the mobile user. The block coordinate descent method is used to refine the contract design and complemented by a generative diffusion model to improve the efficiency of searching for contracts. During the deployment process, the study emphasizes the positioning of UAVs to maximize SP effectiveness. An improved differential evolutionary algorithm is introduced to optimize the positioning of UAVs. Extensive evaluation shows our approach has excellent effectiveness and robustness in deterministic and unpredictable scenarios.

Risk and Opportunity Assessment Under Fuzzy Constraints

Problem context. It is necessary to develop methods for analyzing risks and opportunities in economic systems under the assumption that normative criteria are arbitrarily blurry. Research objective. To propose models and methods for analyzing risks and opportunities when norms are defined by general type fuzzy numbers (GTFN). Research methodology. When the efficiency factor and its norm are defined by GTFN, risk and opportunity assessments can be obtained using alpha cuts of GTFN and subsequent weighting according to the rule of arithmetic means. In certain cases, there are analytical expressions for risk and chance assessments. Practical application of the results. Expressions have been derived for cases where efficiency factors and norms are represented by scalars, intervals, triangular numbers, and GTFN. Corresponding risk functions and chance functions have been constructed. The proposed models and methods have been tested in assessing risks and opportunities for an industry economic system, with evaluation of boundary levels of industry indexes based on risk criteria. Originality and significance. The research is original and applies methods from fuzzy set theory and soft computing. A technology for analyzing risks and opportunities in economic systems has been proposed.

How much partiality is needed for a theory of computability?

Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider function classes which besides the total functions only contain finite functions whose domain of definition is an initial segment of the natural numbers. Such functions appear naturally in computation. We show that a rich computability theory can be developed for these functions classes which embraces the central results of classical computability theory, in which all partial (computable) functions are considered. To do so, the concept of a Gödel number is generalised, resulting in a broader class of numberings. The central algorithmic idea in this approach is to search in enumerated lists. In this way, function computability is reduced to set listability. Besides the development of a computability theory for the functions classes, the new numberings – called quasi-Gödel numberings – are studied from a numbering-theoretic perspective: they are complete, and each of the function classes numbered in this way is a retract of the Gödel numbered set of all partial computable functions. Moreover, the Rogers semi-lattice of all computable numberings of the considered function classes is studied and results as in the case of the computable numberings of the partial computable functions are obtained. The function classes are shown to be effectively given algebraic domains in the sense of Scott–Ershov. The quasi-Gödel numberings are exactly the admissible numberings of the computable elements of the domain. Moreover, the domain can be computably mapped onto every other effectively given one so that every admissible numbering of the computable domain elements is generated by a quasi-Gödel numbering via this mapping.

Algebraic, Analytic, and Computational Number Theory and Its Applications

Analytic number theory is a branch of number theory which inherits methods from mathematical analysis in order to solve difficult problems about the integers [...]

A replication and re-analysis of a classic texture segmentation study.

A classic finding reported in Beck (1966a) is that observers tend to indicate a more natural texture break between a set of T's and tilted T's than between a set of T's and backward L's. This finding has played a prominent role in discussions about the properties of texture segmentation and in the development of computational theories of texture segmentation. Due to the small sample size of the original study, we replicated the original experiment with a larger sample. Regrettably, we discovered that the description in Beck (1966a) is insufficient to allow us to reproduce the stimuli. For our replication, we created stimuli that seem consistent with the spirit of the original study. The results of the replication study partly match Beck's original data ( ), but conclusions indicated by these results deviate from some of Beck's key conclusions. We also further explored the influential claim derived from a second experiment in Beck (1966a) that texture segmentation was not related to the perceived similarity of elements. Contrary to this claim, a re-analysis of Beck's data indicates the counterintuitive conclusion that observers tend to indicate stronger texture segmentation between regions that are rated as being more similar. In a replication of the second experiment, this relation flipped so that the replication observers indicated stronger texture segmentation for regions with lower similarity ratings. Despite being influential, we conclude that there are substantial problems with the stimuli, analyses, and conclusions in Beck (1966a).

Dynamics of entrepreneurial well-being: Insights from computational theory

We explore the dynamics of entrepreneurial performance and well-being through computational theory. Our model connects mechanisms of work-related motivation and strain processes with the unfolding of an entrepreneurial process. The simulation results show that how an entrepreneur’s energy ebbs and flows over their journey, charting certain venturing performance and levels of well-being, can be linked to distinct interplays of ambition, skill, self-regulation, and dynamism. Our work contributes a holistic account of entrepreneurship and well-being, stimulates computational modelling, and enriches discussions about the entrepreneurial future of work.

De Hilbert a los algoritmos cuánticos: el rol del álgebra en el desarrollo de la computación

This presentation examines the fundamental and transformative role algebra has played in the evolution of computing, from the formulation of Hilbert's problems to the development of modern quantum algorithms. By starting with a historical analysis, it highlights how the evolution of algebra is intrinsically intertwined with advances in solving the problems posed by Hilbert. As we move along the timeline, the influence of solid algebraic foundations on the emergence of computation theory and early algorithms is clear, paving the way for an unprecedented era of technological development. In the contemporary era, quantum computing emerges as an emerging Industry 5.0 technology, which relies on advanced algebraic concepts for its operation. It concludes with a discussion of the continuing relevance of algebra in past and future technological developments and the importance of a solid mathematical foundation to address the challenges of Industry 5.0. Through this exploration, the importance of algebra as a central pillar in the development of computer science is highlighted, and ultimately its impact in shaping our technological future.

Chimeras-States in the Distributed Systems in the Case of Multi-Valued Solutions. To the Statement of Possible Research Problems

Nonlinear science has about a hundred years of rapid development. One of the new directions is the study of chimera solutions, i.e. solutions that exhibit significantly different solution behaviour in different regions of space or time. Just a few examples of such behavior have been studied in different systems. However, all examples of chimeras have been single-valued solutions. Recently, however, many nonlinear models of physical and social phenomena have multivalued solutions. It is conceivable that one of the possible directions for further research in chimera science is to allow multivalued solutions to be considered. The paper is devoted to describing some possible research settings in this area. Some modifications of existing models are also proposed. The interesting class of such objects is the models with strong anticipation (models with advanced arguments). Furthermore, some problems of computational theory and mind with such models are discussed.

Unveiling the structural organisation of carvacrol through X-ray scattering and molecular Dynamics: A comparative study with liquid thymol

An integrated approach involving Small and Wide Angle X-ray scattering and computational tools, Molecular Dynamics (MD) and Density Functional Theory (DFT) calculations, was employed to describe the microscopic structural arrangement in carvacrol (2-methyl-5-(1-methylethyl)phenol) at 300 K and 353 K. Carvacrol is a phenol derivative, with an aromatic nature and amphiphilic features and is liquid at room temperature. Its structural organization in the liquid state was compared with the one found for its structural isomer, thymol (5-methyl-2-(1-methylethyl)phenol), at 353 K (in its liquid state), through MD simulations: significant differences between the two compounds have emerged. For carvacrol, at both 300 K and 353 K, there is an inclination for the aromatic rings to orient perpendicularly, maintaining a first neighbour separation of around 6 Å. Conversely, liquid thymol at 353 K exhibits a more heterogeneous structural organisation and is characterised by both parallel and antiparallel orientations of neighbour rings already at shorter distances of approximately 4.5 Å. On a local scale, liquid thymol tends to establish hydrogen bonds (HBs) between its hydroxyl groups, reminiscent of its solid crystalline form. Conversely, carvacrol exhibits a stronger inclination towards O-H···π hydrogen bonding interactions. On a mesoscopic scale, both carvacrol and thymol are characterised by an X-ray scattering low Q peak, which fingerprints the existence of nm-scale structural heterogeneities due to the segregation of HB-interacting polar moieties, embedded within the apolar matrix. Notably, the low Q peak is more pronounced in liquid thymol where the preferential HBs between hydroxyl groups have been observed. Overall, the different structural arrangements of liquid carvacrol and thymol have the potential to influence various bulk and macroscopic properties, including melting points and solvation capabilities. Given these differences, one might envisage the use of carvacrol as a replacement to thymol, in order to fine-tune specific chemical physical properties of applicative interest, including deep eutectic solvents formulation.

Standardized Construction Indicator Assessment and Practice of Digital Government for Chaos Computing Theory

Abstract In this paper, the maximum Lyapunov exponent and chaotic phase space reconstruction method of the chaotic computing model are studied, the embedding dimension is obtained by using the saturated correlation dimension method, and the fractal scale of the chaotic model is determined by the DFA method. Based on the relevant policy documents, an index system for assessing the level of government digital construction is constructed, and the weights of each index are calculated. The constructed index system is used to analyze the digital construction level and digital service quality of the Chinese government, and the evolutionary characteristics of the standardized construction of China’s digital government are analyzed based on the chaotic computing model. The results show that the total score of each provincial government in the sample reaches above 90, only one provincial government has a total score below 80, and the average score of the total score reaches 85.72, which indicates that most of the provincial governments in China have a good level of digital construction. The purpose of this study is to promote and optimize the digital construction of provincial governments and improve their digital construction level, which is of greater practical significance.