If feasibility is an epistemic or pragmatic notion tracking humanly tractable computation, then formal closure under recursion on notation conflates mathematical tractability with physical realizability.
?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.
Physical realizability(the other meaning of 'simulation' in the argument)
Whether something can actually be built or created in the real, physical world (not just in theory).
Pragmatic(as used in philosophy of language and meaning)
Focused on practical, real-world effects and usefulness rather than just abstract theory.
notation(Syntactical and semantic foundation for symbol systems)
A symbol system in which each symbol corresponds to exactly one item in the realm, and each item in the realm corresponds to exactly one symbol in the system.
recursion(HCF's characterization of the core property of FLN)
A cognitive universal capacity posited by HCF that underlies not only natural language but also arithmetic (counting and the successor function), and possibly navigation and social relations; not defined over specifically linguistic inputs and outputs.
tractable(describes how plausible or workable a philosophical theory is)
Easy to work with, manage, or make sense of; not causing problems or being too difficult to deal with.