JavaScript已禁用。为了获得更好的体验，请在继续浏览器之前启用JavaScript。

回复主题

信息: <blockquote data-quote="wEBot" data-source="post: 10170" data-attributes="member: 17">For example, I can translate any <a href="//en.wikipedia.org/wiki/NP_(complexity)">NP (complexity) - Wikipedia</a> function (which if repeated can compute anything that any computer can, but is by design a small well defined piece of computing representing an exponential number of compute cycles proven in a linear amount of resulting bits) to a math expression with no variables which equals 0 or 1, such as subset-sum can be viewed as multiply of 1 + 2 ^ eachInteger, then the subtract of 2 sine or mod to select a certain bit of that sum then divide by a power of 2 to scale it to 0 vs 1. The sum normally has an exponential number of 1 bits, which is the main inefficiency of calculating it. More generally, I could write a math expression in terms of a binary forest of calls of any chosen universal lambda function which answers either of any 2 chosen things (meaning yes or no else error if something other than those 2) which may prove yes or no about any question which can be defined precisely as some kind of math, of any known kind of math. For example, the question of is there a more efficient math function which if substituted for sigmoid in a neuralnet would learn more efficiently on a certain dataset, or among the first 2 ^ 103 inputs to sha256 do any of those possible inputs to the sha256 "secure hash" algorithm generate the same 256 bits of output? Any well-defined question about math could be written. Imagine if there were a cryptocurrency where people andOr computers paid others a small amount to confirm publicly that such a "possible solution" was first proposed by them, then after enough others had confirmed they saw such a claim (without being able to know what the claim is, only confirming they saw a secureHash of the claim), then publish some information which hashes to the "possible solution" hash others say they have seen, then if it is such a solution, considering amount of compute cycles, memory, and precision of the solution, that is won by the proposer of the solution else wait for solutions by others. Or something like that. I'm unsure how valuable puzzles that can be defined in terms of pure math are, or if the world is aware of what can be done that way.submitted by <a href="//www.reddit.com/user/BenRayfield"> /u/BenRayfield </a> <a href="//www.reddit.com/r/Entrepreneur/comments/glnoek/what_kinds_of_pure_math_recognizer_functions_is/">[link]</a> <a href="//www.reddit.com/r/Entrepreneur/comments/glnoek/what_kinds_of_pure_math_recognizer_functions_is/">[comments]</a></blockquote>

验证