Primitive recursion, but using ordinals as bounds instead of integers (ie loops have an ordinal variable which must decrease each iteration)
-
-
-
Replying to @ObjectOfObjects
Right. You would need a computable upper bound for the ordinals that can be used.
1 reply 0 retweets 0 likes -
Replying to @ModelOfTheory
Why does the upper bound need to be computable?
2 replies 0 retweets 0 likes -
Replying to @ObjectOfObjects
Let X be set of ordinals expressible in some data type for ordinals such that < is computable and a∈X ∧ b<a → b∈X. Then sup(X) is computable
2 replies 0 retweets 1 like -
Replying to @ModelOfTheory
Why couldn't we use a set X that violates the second assumption?
1 reply 0 retweets 0 likes
Replying to @ObjectOfObjects
You could, but then the order type of X would still be computable for the same reason, so it doesn't let you do anything different.
5:22 PM - 24 Apr 2017
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.