The quasi-inductiveargument conflates mathematical tractability classes with empirical feasibility, committing a category error Hartmanis and Stearns's original complexity theory never intended.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.
Two computer scientists who developed an important framework for understanding how much computational effort (time or memory) different types of problems require to solve.
Mathematical tractability classes(one of the two different things being wrongly mixed together)
Categories in computer science that group problems based on how difficult they are to solve mathematically—some problems are easy to solve, others are computationally hard.
Quasi-inductive argument(as used in logic and philosophy of mind)
A type of reasoning that isn't quite a traditional inductive argument (where you draw general conclusions from specific examples), but works similarly by building support through multiple pieces of evidence pointing in the same direction.