相关论文: Why Moli\`ere most likely did write his plays
Northrop Frye's theory of four fundamental narrative genres (comedy, romance, tragedy, satire) has profoundly influenced literary criticism, yet computational approaches to his framework have focused primarily on narrative patterns rather…
In his seminal paper ``Computing Machinery and Intelligence'', Alan Turing introduced the ``imitation game'' as part of exploring the concept of machine intelligence. The Turing Test has since been the subject of much analysis, debate,…
Recently, it has been proposed to analyse the literary works, plays or novels, using graphs to display the social network of their interacting characters. In this approach, the timeline of the literary work is lost, because the storyline is…
Since the birth of artificial intelligence 70 years ago, attempts at literary "creation" with computers are present in the course of technological development, creating what one might call "artificial intelligence literature" (AI…
Monsters lurk within mathematical as well as literary haunts. I propose to trace some pathways between these two monstrous habitats. I start from Jeffrey Jerome Cohen's influential account of monster culture and explore how well…
An audience's prior beliefs and morals are strong indicators of how likely they will be affected by a given argument. Utilizing such knowledge can help focus on shared values to bring disagreeing parties towards agreement. In argumentation…
In this work, we employ quantitative methods from the realm of statistics and machine learning to develop novel methodologies for author attribution and textual analysis. In particular, we develop techniques and software suitable for…
These are the lecture notes from a five-hour mini-course given at the Winter School on Galois Theory held at the University of Luxembourg in February 2012. Their aim is to give an overview of Serre's modularity conjecture and of its proof…
The Infinite Monkey Theorem states that if one monkey randomly hits the keys in front of a typewriter keyboard during an infinite amount of time, any works written by William Shakespeare will almost surely be typed out at the end of the…
With the recent advances in Artificial Intelligence (AI) and Large Language Models (LLMs), the automation of daily tasks, like automatic writing, is getting more and more attention. Hence, efforts have focused on aligning LLMs with human…
The goals of this research were to (1) determine if there is agreement both amongst viewers, and between viewers and the performer, about the extent to which performances are authentic, and (2) ascertain whether or not performers and/or…
Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given…
Four centuries before modern statistical linguistics was born, Leon Battista Alberti (1404--1472) compared the frequency of vowels in Latin poems and orations, making the first quantified observation of a stylistic difference ever. Using a…
We introduce the completeness problem for Modal Logic and examine its complexity. For a definition of completeness for formulas, given a formula of a modal logic, the completeness problem asks whether the formula is complete for that logic.…
Dialogue games are two-player logic games between a Proponent who puts forward a logical formula A as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which…
Interest in the mathematical structure of poetry dates back to at least the 19th century: after retiring from his mathematics position, J. J. Sylvester wrote a book on prosody called $\textit{The Laws of Verse}$. Today there is interest in…
In relation to a thesis put forward by Marx Wartofsky, we seek to show that a historiography of mathematics requires an analysis of the ontology of the part of mathematics under scrutiny. Following Ian Hacking, we point out that in the…
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore 1985 for modeling an ideally rational agent's behavior and reasoning…
Since its introduction by P.L. Lions in his lectures and seminars at the College de France, see [9], and also the very helpful notes of Cardialaguet [4] on Lions' lectures, the Master Equation has attracted a lot of interest, and various…
Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable.…