Assuming there is a god do we invent software algorithms or do we adapt natural patterns.... Here is a question and answer from Quora Digest that was in today's link for me. Not a lot is said about the amount of time involved, but it may be shorter than the end of the universe:
David Joyce
July 5, 2020
Ph.D. in Mathematics, University of Pennsylvania (Graduated 1979)
Could there be a computer program, that would take any mathematical expression as input (for example, Fermat's Last Theorem) and then compute a formal mathematical proof as output? How difficult would it be to write such a program?
"There is an algorithm that finds in a finite amount of time a proof of every statement that has a proof, and runs forever for statements that don’t have proofs. The algorithm is just do a breadth-first search.
You can improve on that by searching for a proof while searching for a proof of the negation of the statement. If there is such a proof or a counter-proof, then it will be found. But if the axioms for the theory don’t support either a proof or a counter-proof of a particular statement, then the algorithm runs forever on that statement.
If you have a complete theory, such as elementary Euclidean geometry, then for every statement, either the statement has a proof or its negation has a proof. But if the theory is not complete, such as group theory, then there are statements which don’t have proofs, and their negations don’t have proofs. Number theory is also an incomplete theory as Gödel showed in his incompleteness theorem"
Complete Theories