## Tags » Computability

#### Laws and Computability

Is nature computable?

In the philosophy of science, one model to describe scientific explanations is what is known as the “DN” (deductive-nomological”) model introduced by philosophers Carl Hempel and Paul Oppenheim. 1,628 more words

Philosophy

nannus reblogged this on The Asifoscope and commented:

A new article on my philosophy blog, for those of you who like such stuff :-)

#### Laws and Computability

Is nature computable?

In the philosophy of science, one model to describe scientific explanations is what is known as the “DN” (deductive-nomological”) model introduced by philosophers Carl Hempel and Paul Oppenheim. 1,628 more words

Philosophy

#### The Ackermann Function is not Primitive recursive.

We prove this now.

First note that we define the size of a function as follows:

For unary functions, we simply expect the inequality to hold for every value, so that at at all points. 610 more words

Things That Are True

#### Intuitive Algorithms and Primitive Recursion

In the last post here we examined the strategy of the Squeezing argument. In this post we’ll try to apply this strategy to the notion of an intuitive algorithm or calculable function.   1,420 more words

Things That Are True

#### The Squeezing Theorem and Exactitude

”Clowns to the left of me, jokers to the right…It’s so hard to keep a smile from my face.”

In this post we will (a) prove the squeezing theorem about the limits of functions, and (b) then examine Kriesel’s Squeezing argument for the intuitive notion of logical validity. 1,910 more words

Proof