English
Related papers

Related papers: The basic principles and the structure and algorit…

200 papers

While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…

Computational Complexity · Computer Science 2018-01-23 Akitoshi Kawamura , Martin Ziegler

Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…

Logic · Mathematics 2018-09-13 Stanislaw Ambroszkiewicz

The purpose of this paper is to describe and elaborate the philosophical ideas behind hyperstructures and structure formation in general and emphasize the key ideas of the Hyperstructure Program.

General Mathematics · Mathematics 2019-03-21 Nils A. Baas

A unifying approach to software and hardware design generated by ideas of Idempotent Mathematics is discussed. The so-called idempotent correspondence principle for algorithms, programs and hardware units is described. A software project…

Quantum Physics · Physics 2016-09-08 G. L. Litvinov , V. P. Maslov , A. Ya. Rodionov

Much algorithmic research in NLP aims to efficiently manipulate rich formal structures. An algorithm designer typically seeks to provide guarantees about their proposed algorithm -- for example, that its running time or space complexity is…

Programming Languages · Computer Science 2025-12-30 Tim Vieira , Ryan Cotterell , Jason Eisner

In the monograph, STRONG ARTIFICIAL INTELLIGENCE. On the Approaches to Superintelligence, published by Sberbank, provides a cross-disciplinary review of general artificial intelligence. As an anthropomorphic direction of research, it…

Neurons and Cognition · Quantitative Biology 2022-04-05 Evgenii Vityaev , Anton Kolonin , Andrey Kurpatov , Artem Molchanov

We consider the basic features of complex dynamic and control systems, including systems having hierarchical structure. Special attention is paid to the problems of design and synthesis of complex systems and control models, and to the…

Computational Engineering, Finance, and Science · Computer Science 2008-12-25 Armen Bagdasaryan

Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time, scale with the problem size. Many problems in…

Computational Complexity · Computer Science 2021-07-29 Davide Cirillo , Miguel Ponce-de-Leon , Alfonso Valencia

In this paper we suggest how the mathematical concept of hyperstructures may be a useful tool in the study of the higher, hierachical structure of languages.

General Mathematics · Mathematics 2018-06-15 Nils A. Baas

Software Engineering and the implementation of software has become a challenging task as many tools, frameworks and languages must be orchestrated into one functioning piece. This complexity increases the need for testing and analysis…

Software Engineering · Computer Science 2018-06-27 Hannes Thaller

This paper explores the issues around the construction of large-scale complex systems which are built as 'systems of systems' and suggests that there are fundamental reasons, derived from the inherent complexity in these systems, why our…

Software Engineering · Computer Science 2011-09-16 Ian Sommerville , Dave Cliff , Radu Calinescu , Justin Keen , Tim Kelly , Marta Kwiatkowska , John McDermid , Richard Paige

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.

Quantum Physics · Physics 2019-01-21 Federico Holik , Giuseppe Sergioli , Hector Freytes , Angelo Plastino

A set of general physical principles is proposed as the structural basis for the theory of complex systems. First the concept of harmony is analyzed and its different aspects are uncovered. Then the concept of reflection is defined and…

Disordered Systems and Neural Networks · Physics 2007-05-23 D. B. Saakian

Starting from the pioneering works on software architecture precious guidelines have emerged to indicate how computer programs should be organized. For example the "separation of concerns" suggests to split a program into modules that…

Software Engineering · Computer Science 2010-03-30 A. D. Chepelianskii

Most ideas about what an algorithm is are very similar. Basic operations are used for transforming objects. The evaluation of internal and external states by relations has impact on the further process. A more precise definition can lead to…

Logic · Mathematics 2025-02-26 Christine Gaßner

The aim of this paper is to discuss some applications of general topology in computer algorithms including modeling and simulation, and also in computer graphics and image processing. While the progress in these areas heavily depends on…

Numerical Analysis · Mathematics 2012-01-23 Rastislav Telgarsky

We present probabilistic neural programs, a framework for program induction that permits flexible specification of both a computational model and inference algorithm while simultaneously enabling the use of deep neural networks.…

Neural and Evolutionary Computing · Computer Science 2016-12-05 Kenton W. Murray , Jayant Krishnamurthy

We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together…

We present a first-principles computer code package (ABACUS) that is based on density functional theory and numerical atomic basis sets. Theoretical foundations and numerical techniques used in the code are described, with focus on the…

Materials Science · Physics 2015-03-03 Pengfei Li , Xiaohui Liu , Mohan Chen , Peize Lin , Xinguo Ren , Lin Lin , Chao Yang , Lixin He

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse , Marc Chardin