computationally infeasible
question: What makes for a theoretically possible theorem be difficult to find derivations?, context: Automated theorem proving refers to the development of computer programs that search and find derivations (formal proofs) of mathematical theorems. Finding derivations is a difficult task because the search space can be very large; an exhaustive search of every possible derivation is theoretically possible but computationally infeasible for many systems of interest in mathematics. Thus complicated heuristic functions are developed to attempt to find a derivation in less time than a blind search.
What makes for a theoretically possible theorem be difficult to find derivations?
Finding derivations is a difficult task because the search space can be very large; an exhaustive search of every possible derivation is theoretically possible but computationally infeasible for many systems of interest in mathematics.
Automated theorem proving refers to the development of computer programs that search and find derivations (formal proofs) of mathematical theorems. Finding derivations is a difficult task because the search space can be very large; an exhaustive search of every possible derivation is theoretically possible but computationally infeasible for many systems of interest in mathematics. Thus complicated heuristic functions are developed to attempt to find a derivation in less time than a blind search.
Finding derivations is a difficult task because the search space can be very large; an exhaustive search of every possible derivation is theoretically possible but <hl> computationally infeasible <hl> for many systems of interest in mathematics.
Automated theorem proving refers to the development of computer programs that search and find derivations (formal proofs) of mathematical theorems. Finding derivations is a difficult task because the search space can be very large; an exhaustive search of every possible derivation is theoretically possible but <hl> computationally infeasible <hl> for many systems of interest in mathematics. Thus complicated heuristic functions are developed to attempt to find a derivation in less time than a blind search.
Automated theorem proving refers to the development of computer programs that search and find derivations (formal proofs) of mathematical theorems. <hl> Finding derivations is a difficult task because the search space can be very large; an exhaustive search of every possible derivation is theoretically possible but computationally infeasible for many systems of interest in mathematics. <hl> Thus complicated heuristic functions are developed to attempt to find a derivation in less time than a blind search.