Related papers: Card game restriction in LHC can only be successfu…
The model of Nielsen and Ninomiya claims that "the SSC (Superconducting Supercollider) were stopped by the US Congress due to the backward causation from the big amounts of Higgs particles, which it would have produced, if it had been…
We have earlier proposed the idea of making card drawing experiment of which outcome potentially decides whether Large Hadron Collider (LHC for short) should be closed or not. The purpose is to test theoretical models which, like e.g. our…
We propose an experiment which consists of drawing a card and using it to decide restrictions on the running of Large Hadron Collider (LHC for short) at CERN, such as luminosity, and beam energy. There may potentially occur total shut down.…
We analyse an iterated version of Nielsen and Ninomiya (N&N)'s proposed card game experiment to search for a specific type of backward causation on the running of the Large Hadron Collider (LHC) at CERN. We distinguish "endogenous" and…
We consider a card guessing game with complete feedback. A ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards, where one after…
Hardware, systems and algorithms research communities have historically had different incentive structures and fluctuating motivation to engage with each other explicitly. This historical treatment is odd given that hardware and software…
We examine the advantages that quantum strategies afford in communication-limited games. Inspired by the card game blackjack, we focus on cooperative, two-party sequential games in which a single classical bit of communication is allowed…
We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is shelf-shuffled exactly one time. One after the other a single card is drawn from the shuffled deck. The guesser makes has guess…
Despite early hopes that the Large Hadron Collider (LHC) would quickly unveil supersymmetric particles, none have been detected to date. This review examines the impact of the LHC results on the viability of weak-scale supersymmetry, and…
Motivated by the results for Magic: The Gathering presented in [CBH20] and [Bid20], we study a (different) computability problem about winning strategies in Yu-Gi-Oh! Trading Card Game, a popular card game developed and published by Konami.…
This paper concludes five years of AI competitions based on Legends of Code and Magic (LOCM), a small Collectible Card Game (CCG), designed with the goal of supporting research and algorithm development. The game was used in a number of…
Randomness is an important factor in games, so much so that some games rely almost purely on it for its outcomes and increase players' engagement with them. However, randomness can affect the game experience depending on when it occurs in a…
The large and growing library of measurements from the Large Hadron Collider has significant power to constrain extensions of the Standard Model. We consider such constraints on a well-motivated model involving a gauged and…
Quirks are exotic particles charged under a new confining gauge group that can give rise to unique collider signatures, depending on their vector-like mass, quantum numbers, and the confinement scale. In this work, we consider the…
The Large Hadron Collider will provide an unprecedented quantity of collision data right from the start-up. The challenge for the LHC experiments is the quick use of these data for the final commissioning of the detectors, including…
Understanding the properties of games played under computational constraints remains challenging. For example, how do we expect rational (but computationally bounded) players to play games with a prohibitively large number of states, such…
We discuss the existence of Hamilton cycles in the random graph $G_{n,p}$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order and (iii) there is a bound on the number of…
In simple card games, cards are dealt one at a time and the player guesses each card sequentially. We study problems where feedback (e.g. correct/incorrect) is given after each guess. For decks with repeated values (as in blackjack where…
We consider the following card guessing game with no feedback. An ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards. One after…
This paper proposes a new algorithm deciding the star height problem. As shown by Kirsten, the star height problem reduces to a problem concerning automata with counters, called limitedness. The new contribution is a different algorithm for…