julesh@artificialmind I know of one way to construct a total computable function that is not structurally recursive (bar recursion is the best known example), but it's for functions with a type like (N -> N) -> N, I don't remember how it adapts to N -> N computability
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.