English
Related papers

Related papers: An Impossible Asylum

200 papers

We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…

Computational Complexity · Computer Science 2015-06-04 Mario Szegedy , Yixin Xu

Arrow's `impossibility' theorem asserts that there are no satisfactory methods of aggregating individual preferences into collective preferences in many complex situations. This result has ramifications in economics, politics, i.e., the…

Theoretical Economics · Economics 2019-09-18 T. Erber , M. J. Frank

We investigate the complexity of a puzzle that turns out to be NL-complete.

Computational Complexity · Computer Science 2015-07-13 Holger Petersen

Securing a secret master key is a non-trivial task, we even argue it is impossible to fully secure it, hence we must make it as difficult as possible for any powerful adversary to steal or use the key. We introduce the reader to interesting…

Cryptography and Security · Computer Science 2021-07-02 Hannes Salin , Dennis Fokin

This paper presents formulae that can solve various seemingly hopeless philosophical conundrums. We discuss the simulation argument, teleportation, mind-uploading, the rationality of utilitarianism, and the ethics of exploiting artificial…

Artificial Intelligence · Computer Science 2017-01-06 Gabriel Leuenberger

We establish fundamental mathematical limits on universal approximation theorem (UAT) system alignment by proving that catastrophic failures are an inescapable feature of any useful computational system. Our central thesis is that for any…

Machine Learning · Computer Science 2025-07-08 Jasper Yao

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We present the first known solution to the original supertask, the Thomson Lamp Paradox. We also offer preliminary resources for classifying computational complexity of various supertasks. In so doing we consider a newly apparent paradox…

Logic in Computer Science · Computer Science 2015-03-20 Abhishek Bose-Kolanu

The title of the article is identical to the title of Chapter 21 in Gardner (2001): because we are going to analyze the probability calculations and the ambiguity of the problem statements. We will analyze 3 out of 4 problems from Gardner…

Probability · Mathematics 2024-12-31 A. Hayrapetyan

Explaining autonomous and intelligent systems is critical in order to improve trust in their decisions. Counterfactuals have emerged as one of the most compelling forms of explanation. They address ``why not'' questions by revealing how…

Artificial Intelligence · Computer Science 2026-02-05 Leila Amgoud , Martin Cooper

Nonogram is a popular combinatorial puzzle (similar in nature to Sudoku or Minesweeper) in which a puzzle solver must determine if there exists a setting of the puzzle parameters that satisfy a given set of constraints. It has long been…

Computational Complexity · Computer Science 2025-09-12 Aaron Foote , Danny Krizanc

Developing a better understanding of surprising or counterintuitive phenomena has constituted a significant portion of deep learning research in recent years. These include double descent, grokking, and the lottery ticket hypothesis --…

Machine Learning · Computer Science 2025-07-01 Alan Jeffares , Mihaela van der Schaar

In this paper, I will demonstrate a new perspective on the Two Envelope Problem. I hope to show with convincing clarity how the paradox results from an inherent problem pertaining to the interpretation of Bayesian probability. Specifically,…

Other Statistics · Statistics 2012-08-27 Eric Bliss

In this short article, we look at an old logical puzzle, its solution and proof and discuss some interesting aspects concerning its representation in a logic programming language like Prolog. We also discuss an intriguing information…

Logic in Computer Science · Computer Science 2011-11-09 Anand Venkataraman , Ray Kemp

In the 90's a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some Representation Theoretical problems arising from the Theory of Macdonald polynomials. This collection was enriched in the research that led…

Combinatorics · Mathematics 2014-05-05 Francois Bergeron , Adriano Garsia , Emily Leven , Guoce Xin

The definition of negation has to be referred to the totality of a theory and at last to what is defined as the organization of a scientific theory; in other words, the definition of negation is of a structural kind, rather than of an…

Logic · Mathematics 2021-01-05 Antonino Drago

This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based on recurrence sequences. The result uses ingredients of the…

Number Theory · Mathematics 2019-03-19 Jon Grantham

Here, by introducing a version of Unexpected hanging paradox first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical…

Logic · Mathematics 2015-06-30 Farzad Didehvar

Well known Simpson's paradox is puzzling and surprising for many, especially for the empirical researchers and users of statistics. However there is no surprise as far as mathematical details are concerned. A lot more is written about the…

Other Statistics · Statistics 2018-04-24 Priyantha Wijayatunga

Artificial objects often subjectively look eerie when their appearance to some extent resembles a human, which is known as the uncanny valley phenomenon. From a cognitive psychology perspective, several explanations of the phenomenon have…

Human-Computer Interaction · Computer Science 2016-09-21 Takahiro Kawabe , Kyoshiro Sasaki , Keiko Ihaya , Yuki Yamada
‹ Prev 1 3 4 5 6 7 10 Next ›