Tags » Computability

Intelligence is inexplicable

So, the question still remains – after spending endless nights in front of a bright screen, surrounded by empty pizza boxes and the soft hum of cooling fans – when does your program finally count as “intelligent”? 1,238 more words

Computers

Closing the Circle: Is every algorithm Machine Computable?

In the last few posts we have argued that (1) every recursive function describes an intuitive algorithm and (2) that every machine computation can be described as a recursive function. 2,090 more words

Logic

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,426 more words

Things That Are True