相关论文: The Problem Of Grue Isn't

The systematic biases seen in people's probability judgments are typically taken as evidence that people do not reason about probability using the rules of probability theory, but instead use heuristics which sometimes yield reasonable…

We examine the relationship between the Bayesian and information-theoretic formulations of source separation algorithms. This work makes use of the relationship between the work of Claude E. Shannon and the "Recent Contributions" by Warren…

We consider the problem of rational uncertainty about unproven mathematical statements, remarked on by G\"odel and others. Using Bayesian-inspired arguments we build a normative model of fair bets under deductive uncertainty which draws…

There are things we know, things we know we don't know, and then there are things we don't know we don't know. In this paper we address the latter two issues in a Bayesian framework, introducing the notion of doubt to quantify the degree of…

We apply decision tree induction to the problem of discourse clue word sense disambiguation with a genetic algorithm. The automatic partitioning of the training set which is intrinsic to decision tree induction gives rise to linguistically…

This is a work in two parts devoted to solutions of the so-called {\em four Landau's problems} in Number Theory, listed by Edmund Landau at the 1912 International Congress of Mathematics. In Part I the {\em Goldbach's conjecture} is proved.…

The reader is reminded of several puzzles involving randomness. These may be ill-posed, and if well-posed there is sometimes a solution that uses probabilistic intuition in a special way. Various examples are presented including the well…

The emergence of intrinsic probability has long been one of the most important and puzzling problems in quantum mechanics, and the law most directly related to this problem is the Born rule. For a century, there have been many attempts to…

Riddles based on simple puns can be classified according to the patterns of word, syllable or phrase similarity they depend upon. We have devised a formal model of the semantic and syntactic regularities underlying some of the simpler types…

In the Structure of Appearance and in Problems and Projects, Nelson Goodman has constructed a theory of complexity whose elements are the predicates of a system. One of his main results is a closed formula to evaluate v[n-pl], the maximum…

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

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…

Logic has its origins in basic questions about the nature of the real world and how we describe it. This article seeks to bring out the physical and epistemological relevance of some of the more recent technical work in logic and…

Philosophical analyses of causation take many forms but one major difficulty they all aim to address is that of the spatio-temporal continuity between causes and their effects. Bertrand Russell in 1913 brought the problem to its most…

If Turing's groundbreaking paper in 1936 laid the foundation of the theory of computation (ToC), it is no exaggeration to say that Cook's paper in 1971, "The complexity of theorem proving procedures", [4] has pioneered the study of…

Humor recognition has been widely studied as a text classification problem using data-driven approaches. However, most existing work does not examine the actual joke mechanism to understand humor. We break down any joke into two distinct…

Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study {\em abduction with penalization} in logic programming. This…

In this short note I restate and simplify the proof of the impossibility of probabilistic induction from Popper (1992). Other proofs are possible (cf. Popper (1985)).

We apply recent ideas about complexity and randomness to the philosophy of laws and chances. We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature. The first, a generative chance* law, employs a…

Goedel's results have had a great impact in diverse fields such as philosophy, computer sciences and fundamentals of mathematics. The fact that the rule of mathematical induction is contradictory with the rest of clauses used by Goedel to…