mersenneforum.org superpermutations
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2018-10-27, 12:31   #1
kriesel

"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

1BB916 Posts
superpermutations

Anonymous partial solution https://www.theverge.com/2018/10/24/...i-math-mystery
Quote:
 there are no known applications for the formula, which isn’t unusual in the field. It often takes decades, Pantone says, for formulas that are discovered in pure mathematics to make their way into real-world applications.
Well. A few seconds later:

Suppose one has software to test. In automated testing, how many case variations would constitute exercise for every possible sequence of discrete code sections between branches? Then along with computed bounds on running time of the code sections, one could estimate total test time. If any two or more sections have at least one variable in common, and modify that variable, one section can affect the behavior of the other(s).
Given that the bounds for 14 episodes were determined to be 93,884,313,611 to 93,924,230,411 possible sequential orderings, testability in feasible duration seems a strong argument for highly modular code.
Code does not have complete freedom for which section runs first, second, last, etc. and some sections may not be run at all in some cases. But the problem seems related.

Last fiddled with by kriesel on 2018-10-27 at 12:38

2018-12-08, 13:15   #2
science_man_88

"Forget I exist"
Jul 2009
Dartmouth NS

2·3·23·61 Posts

Quote:
 Originally Posted by kriesel Anonymous partial solution https://www.theverge.com/2018/10/24/...i-math-mystery Well. A few seconds later: Suppose one has software to test. In automated testing, how many case variations would constitute exercise for every possible sequence of discrete code sections between branches? Then along with computed bounds on running time of the code sections, one could estimate total test time. If any two or more sections have at least one variable in common, and modify that variable, one section can affect the behavior of the other(s). Given that the bounds for 14 episodes were determined to be 93,884,313,611 to 93,924,230,411 possible sequential orderings, testability in feasible duration seems a strong argument for highly modular code. Code does not have complete freedom for which section runs first, second, last, etc. and some sections may not be run at all in some cases. But the problem seems related.

gives a use I think locks that don't reset when you make your combination. I might be thinking a different video though.

Last fiddled with by science_man_88 on 2018-12-08 at 13:18

All times are UTC. The time now is 09:20.

Wed Dec 7 09:20:10 UTC 2022 up 111 days, 6:48, 0 users, load averages: 1.00, 0.88, 0.87

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔