ミレニアム懸賞問題 (635ﾚｽ)
上下前次1-新
抽出解除 ﾚｽ栞
ﾘﾛｰﾄﾞ規制です｡10分ほどで解除するので､他のﾌﾞﾗｳｻﾞへ避難してください｡
294(1): ◆Ph05QxAcng [] 2024/03/10(日)01:05 ID:86TMEkfZ(2/15)
>>293
Lemma 2: The inclusion relation ⊇ and the correspondence relation → are equivalent.
Proof:
If the inclusion relation A⊇B holds, then the correspondence relation A→B holds. Conversely, assume the correspondence relation A→B holds. In this case, the premise that if something exists, then all elements are in space, and from Corollary 1.1, that the existence of elements in space implies an inclusion relation, demonstrates the proposition.
Lemma 3: The inclusion relation ⊇ and the causal relation → are equivalent.
Proof:
Clearly, if a causal relation exists, then, as per Corollary 1.1, since there are elements in space, an inclusion relation is derived. Next, we demonstrate that a causal relation can be derived from an inclusion relation. When A⊇B holds, a causal relation that if B then A belongs, holds. Thus, the proposition is demonstrated.
Next, we provide the proof of the theorem.
Existence and outline are equivalent, outline and wave (inclusion relation ⊇) are equivalent, and the inclusion relation and causal relation (logic →) are equivalent. Therefore, taking the physical space of this visible reality = existence as the foremost premise, everything that follows is represented. In other words, it may be said that the essence of this world is the visible space. Therefore, if the proof of every true proposition exists, it contradicts not existing in visible space. Thus, the theorem is demonstrated.
Corollary: For every true proof problem, as time is infinitely increased (with ∞^n, where n can be made as large as possible), the ratio of solved problems converges to 1.
295(1): ◆Ph05QxAcng [] 2024/03/10(日)01:06 ID:86TMEkfZ(3/15)
>>294
Now, if we assume that the proposition does not hold, then for every problem, there exists a problem a whose algorithm does not match the class of the problem, and is of a smaller class.
At this time, it is possible to create a program A that generates problem a infinitely.
Let there be a program X that creates problems infinitely, and let r(X) be the ratio of the total problems solved by it.
In the case of A, even if we take n as large as possible with time being ∞^n, r(A) converges to 0.
Let P be the set of all true proof problems, and let p be the set of all computational problems, then P ⊃ p.
To solve a computational problem means to demonstrate the following two points:
(1) Decide whether there is a better algorithm than brute force search, and if it exists, demonstrate that it is the best; if not, demonstrate its non-existence.
(2) If it exists, verify whether a solution exists using that algorithm and specifically output the value. If it does not exist, verify the existence of a solution through brute force search.
上下前次1-新書関写板覧索設栞歴
ｽﾚ情報 赤ﾚｽ抽出 画像ﾚｽ抽出 歴の未読ｽﾚ AAｻﾑﾈｲﾙ
ぬこの手 ぬこTOP 0.029s