Unless you can demonstrate that humans can solve a function that exceeds the Turing computable, it is reasonable to assume we're non more than Turing complete, and all Turing complete systems can compute the same set of functions.
As it stands, we don't even know of any functions that exceeds the Turing complete, but are computable.
> As it stands, we don't even know of any functions that exceeds the Turing complete, but are computable.
That would require the universe to be discrete, we don't know that. Otherwise most continuous processes compute something that a Turing machine can't, the Turing machine can only approximate it.
You can compute with values that are not discrete just fine by expressing them symbolically. I can't write out 1/3 as a discrete value in base 10, but I can still compute with it just fine.
As it stands, we don't even know of any functions that exceeds the Turing complete, but are computable.