Strictly speaking, isn't the link between whether an algo is polynomial or not in time complexity only loosely related to its intractability? ie: polynomial us

Strictly speaking, isn't the link between whether an algo is polynomial or not in time complexity only loosely related to its intractability? ie: polynomial usually correlates with tractable but not necessarily? My knowledge in this is rusty though so please correct me if that's inaccurate.