中文
相关论文

相关论文: Cheryl's Birthday

200 篇论文

This is a set of 288 questions written for a Moore-style course in Mathematical Logic. I have used these (or some variation) four times in a beginning graduate course. Topics covered are: propositional logic axioms of ZFC wellorderings and…

逻辑 · 数学 2008-02-03 Arnold W. Miller

In 1994, P.-G. Becker and W. Bergweiler listed all the differentially algebraic solutions of three famous functional equations: the Schr{\"o}der's, B{\"o}ttcher's and Abel's equations. The proof of this theorem combines various domains of…

数论 · 数学 2021-02-25 Gwladys Fernandes

In this paper, we introduce the notion of a $(a,b)$-rectangle pattern on permutations that not only generalizes the notion of successive elements (bonds) in permutations, but is also related to mesh patterns introduced recently by…

组合数学 · 数学 2013-04-17 Sergey Kitaev , Jeffrey Remmel

The fermion generation puzzle has survived into this century as one of the great mysteries in particle physics. We consider here a possible solution within the Standard Model framework based on a nonabelian generalization of…

高能物理 - 理论 · 物理学 2016-12-21 HM Chan

This paper is an adaptation of the introduction to a book project by the late Mitchell J. Feigenbaum (1944-2019). While Feigenbaum is certainly mostly known for his theory of period doubling cascades, he had a lifelong interest in optics.…

历史与综述 · 数学 2023-03-28 Jean-Pierre Eckmann

A random jigsaw puzzle is constructed by arranging $n^2$ square pieces into an $n \times n$ grid and assigning to each edge of a piece one of $q$ available colours uniformly at random, with the restriction that touching edges receive the…

离散数学 · 计算机科学 2016-05-12 Rajko Nenadov , Pascal Pfister , Angelika Steger

Pencil puzzles are puzzles that can be solved by writing down solutions on a paper, using only logical reasoning. In this paper, we utilize the "T-metacell" framework developed by Tang and the MIT Hardness Group to prove the NP-completeness…

计算复杂性 · 计算机科学 2026-01-15 Nattapol Kiatchaipipat , Suthee Ruangwises

I discuss puzzles that require thinking outside the box. I also discuss the box inside of which many people think.

综合数学 · 数学 2016-05-10 Tanya Khovanova

An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and…

计算机科学中的逻辑 · 计算机科学 2017-05-23 Juliana Bowles , Marco B. Caminati

This is a prelude to a book which I intend to publish. This paper describes my temporary thoughts on Einstein's pathway to the special theory of relativity. See my papers on my thoughts on Einstein's pathway to his general theory of…

物理学史与哲学 · 物理学 2012-04-10 Galina Weinstein

This paper offers a new concept of {\it possibility} as an alternative to the now-a-days standard concept originally introduced by L.A. Zadeh in 1978. This new version was inspired by the original but, formally, has nothing in common with…

人工智能 · 计算机科学 2025-10-06 Daniel G. Schwartz

In this paper, we present a curious experiment with the hot list strategy in solving sliding block puzzles by paramodulation. The hot list strategy is one of the look-ahead strategies using paramodulation in automated reasoning. We define…

计算复杂性 · 计算机科学 2022-01-11 Ruo Ando , Yoshiyasu Takefuji

In honor of Alan Turing's hundredth birthday, I unwisely set out some thoughts about one of Turing's obsessions throughout his life, the question of physics and free will. I focus relatively narrowly on a notion that I call "Knightian…

量子物理 · 物理学 2013-06-10 Scott Aaronson

In the process of studying a conjecture of Holly M. Green and Martin W. Liebeck, we obtain two interesting identities by elementary methods, one is a combinatorial identity, and the other is a number theoretic identity.

综合数学 · 数学 2021-04-22 Junyao Pan

Classical probability theory is formulated using sets. In this paper, we extend classical probability theory with propositional computability logic. Unlike other formalisms, computability logic is built on the notion of events/games, which…

人工智能 · 计算机科学 2020-06-23 Keehang Kwon

Birthday problem is a well-known classic problem in probability theory widely applied in cryptography, and bubble sort is a popular sorting algorithm leading to some interesting theoretical problems in computer science. However, the…

概率论 · 数学 2024-09-24 Jichu Jiang

This is an extended essay review of Tanya and Jeffrey Bub's Totally Random: Why Nobody Understands Quantum Mechanics: A serious comic on entanglement. Princeton and Oxford: Princeton University Press (2018), ISBN: 9780691176956, 272 pp.,…

物理学史与哲学 · 物理学 2021-03-01 Michael E. Cuffaro , Emerson P. Doyle

The black hole information problem has been a challenge since Hawking's original 1975 paper. It led to the discovery of AdS/CFT, which gave a partial resolution of the paradox. However, recent developments, in particular the firewall…

高能物理 - 理论 · 物理学 2016-12-21 Joseph Polchinski

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Samuel R. Buss , Alexander S. Kechris , Anand Pillay , Richard A. Shore

This paper serves as the announcement of my program---a joke version of the Langlands Program. In connection with this program, I discuss an old hat puzzle, introduce a new hat puzzle, and offer a puzzle for the reader.

历史与综述 · 数学 2014-04-22 Tanya Khovanova