If physically realizable processes can decide undecidable sets, then 'computable' cannot be conceptually identified with finite-step algorithmic decidability sans further qualification.
?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.
A French word meaning 'without'; philosophers use it in English writing to mean 'without' or 'lacking.'
undecidable sets(as used in logic and computability theory)
Collections of problems or questions for which no algorithm (step-by-step procedure) can ever be created to determine whether something belongs to that collection or not.