scientific article; zbMATH DE number 3547240
From MaRDI portal
Publication:4121861
zbMath0352.01009MaRDI QIDQ4121861
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Philosophy of mathematics (00A30) History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) Development of contemporary mathematics (01A65)
Related Items (85)
Logic of infinite quantum systems ⋮ Coding with noiseless feedback ⋮ Strategies for the Renyi--Ulam game with fixed number of lies ⋮ A halfliar's game ⋮ Solution of Ulam's problem on searching with a lie ⋮ Complexity of question/answer games ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Mathematical problems and games ⋮ Nonlinear waves described by a fifth-order equation derived from the Fermi-Pasta-Ulam system ⋮ Prefix search with a lie ⋮ On the last question of Stefan Banach ⋮ Three Thresholds for a Liar ⋮ Detecting errors in searching games ⋮ Ulam's searching game with lies ⋮ Book review of: M. Urbanek, Geniuses. The Lvov School of Mathematics ⋮ Optimal comparison strategies in Ulam's searching game with two errors ⋮ From the Fermi-Pasta-Ulam model to higher-order nonlinear evolution equations ⋮ Unnamed Item ⋮ The halflie problem. ⋮ Coping with errors in binary search procedures ⋮ Computer experiments and visualization in mathematics and physics: a subjective short walk among some historical examples ⋮ \(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ Open Problems on Search Games ⋮ On history-dependent optimization models: a unified framework to analyze models with habits, satiation and optimal growth ⋮ Correcting a single error in feedback channels ⋮ Social processes and proofs of theorems and programs ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ On a quantitative theory of limits: estimating the speed of convergence ⋮ The mathematical work of John C. Oxtoby ⋮ Algorithms for \(q\)-ary error-correcting codes with limited magnitude and feedback ⋮ When did Hermann Weyl pass away? ⋮ Designing reliable algorithms in unreliable memories ⋮ Propositional dynamic logic for searching games with errors ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Asymptotic simplification for solutions of the energy critical nonlinear wave equation ⋮ Conditioning a state by a Łukasiewicz event: a probabilistic approach to Ulam games ⋮ Optimal strategies against a liar ⋮ Ulam's searching game with a fixed number of lies ⋮ Solution of Ulam's problem on binary search with three lies ⋮ An algorithm for ``Ulam's Game and its application to error correcting codes ⋮ Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games ⋮ Binary search in graphs revisited ⋮ The symmetries of solitons ⋮ Ulam, the man and the mathematician ⋮ Searching with lies under error cost constraints ⋮ The Rényi-Ulam games and many-valued logics ⋮ Signature codes for noisy multiple access adder channel ⋮ A simple solution to Ulam's liar game with one lie ⋮ Searching with lies: The Ulam problem ⋮ On sorting in the presence of erroneous information ⋮ Search When the Lie Depends on the Target ⋮ How to play the majority game with a liar ⋮ Rényi-Ulam Game Semantics for Product Logic and for the Logic of Cancellative Hoops ⋮ Unnamed Item ⋮ Top Varieties of Generalized MV-Algebras and Unital Lattice-Ordered Groups ⋮ When \textit{I cut, you choose} method implies intransitivity ⋮ Complex systems, modelling and simulation ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Least adaptive optimal search with unreliable tests ⋮ How to play the one-lie Rényi-Ulam game ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice ⋮ Minimum number of queries for an adaptive liar search game with small sets ⋮ Sorting and searching in faulty memories ⋮ Ulam's searching game with three lies ⋮ Separable collusion-secure multimedia codes ⋮ Ergodic theorems in demography ⋮ Ulam's searching game with two lies ⋮ Searching with a forbidden lie pattern in responses ⋮ Optimal resilient sorting and searching in the presence of memory faults ⋮ Two-batch liar games on a general bounded channel ⋮ Hypothesis test for causal explanations in human pathology: Evaluation of pulmonary edema in 181 autopsied patients with leukemia ⋮ Binary Search in Graphs Revisited ⋮ From Logic to Computer Science – A Personal Experience ⋮ Perfect two-fault tolerant search with minimum adaptiveness ⋮ The Rényi-Ulam pathological liar game with a fixed number of lies ⋮ Dispersive fractalisation in linear and nonlinear Fermi–Pasta–Ulam–Tsingou lattices ⋮ Kurt Gödel in sharper focus ⋮ Searching with lies under error transition cost constraints ⋮ Q-ary Ulam-Rényi game with constrained lies ⋮ The Interval Liar Game ⋮ Playing by searching: Two strategies against a linearly bounded liar ⋮ An improved heuristic for the ``Ulam-Rényi game ⋮ An efficient noisy binary search in graphs via Median approximation ⋮ On error correction with errors in both the channel and syndrome
This page was built for publication:
