English
Related papers

Related papers: Comment on Is Complexity an Illusion?

200 papers

We analyse the complexity of environments according to the policies that need to be used to achieve high performance. The performance results for a population of policies leads to a distribution that is examined in terms of policy…

Artificial Intelligence · Computer Science 2013-02-11 Jose Hernandez-Orallo

We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\varepsilon,d)$ of these problems. The information complexity is…

Numerical Analysis · Mathematics 2019-05-06 David Krieg

Researchers have derived many theoretical models for specifying users' insights as they interact with a visualization system. These representations are essential for understanding the insight discovery process, such as when inferring user…

Human-Computer Interaction · Computer Science 2023-10-20 Leilani Battle , Alvitta Ottley

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…

Computational Complexity · Computer Science 2016-02-05 Sylvain Schmitz

It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the…

Logic · Mathematics 2019-02-15 Fernando Soler-Toscano

The unwavering success of deep learning in the past decade led to the increasing prevalence of deep learning methods in various application fields. However, the downsides of deep learning, most prominently its lack of trustworthiness, may…

Machine Learning · Computer Science 2024-08-13 Holger Boche , Vit Fojtik , Adalbert Fono , Gitta Kutyniok

This paper deals with the arrow of complexification of engineering. We claim that the complexification of engineering consists in (a) that shift throughout which engineering becomes a science; thus it ceases to be a (mere) praxis or…

Adaptation and Self-Organizing Systems · Physics 2013-10-02 Carlos Eduardo Maldonado , Nelson Alfonso Gómez-Cruz

Any system based on axioms is incomplete because the axioms cannot be proven from the system, just believed. But one system can be less-incomplete than other. Neutrosophy is less-incomplete than many other systems because it contains them.…

General Mathematics · Mathematics 2007-05-23 Carlos Gershenson

Education at all levels is facing several challenges in most countries, such as low quality, high costs, lack of educators, and unsatisfied student demand. Traditional approaches are becoming unable to deliver the required education.…

Computers and Society · Computer Science 2016-04-01 Carlos Gershenson

Survey of several forms of updating, with a practical illustrative example. We study several updating (conditioning) schemes that emerge naturally from a common scenarion to provide some insights into their meaning. Updating is a subtle…

Artificial Intelligence · Computer Science 2013-03-26 Philippe Smets

Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

We consider training probabilistic classifiers in the case of a large number of classes. The number of classes is assumed too large to perform exact normalisation over all classes. To account for this we consider a simple approach that…

Machine Learning · Statistics 2016-07-08 David Barber , Aleksandar Botev

The apparent failure of individual probabilistic expressions to distinguish uncertainty about truths from uncertainty about probabilistic assessments have prompted researchers to seek formalisms where the two types of uncertainties are…

Artificial Intelligence · Computer Science 2013-04-11 Judea Pearl

The science of complexity is far from being fully understood and even its foundations are not well established. On the other hand, during the last decade, the random motion of particles or waves - the so-called diffusion - has been known…

Statistical Mechanics · Physics 2009-08-14 Guilherme R. Rezende , Luciano C. Lapas , Fernando A. Oliveira

We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…

Computational Complexity · Computer Science 2020-05-05 Gregorio Malajovich , Mike Shub

We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…

Formal Languages and Automata Theory · Computer Science 2022-05-03 Joel D. Day , Vijay Ganesh , Nathan Grewal , Florin Manea

The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…

Statistical Mechanics · Physics 2023-10-04 Roberto C. Alamino

Causal multiteam semantics is a framework where probabilistic dependencies arising from data and causation between variables can be together formalized and studied logically. We consider several logics in the setting of causal multiteam…

Logic in Computer Science · Computer Science 2023-03-22 Fausto Barbero , Jonni Virtema

The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues…

Artificial Intelligence · Computer Science 2011-05-30 D. Calvanese , M. Lenzerini , D. Nardi

Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an…

Logic in Computer Science · Computer Science 2023-06-22 Giorgi Japaridze