An Effective Procedure for Computing “Uncomputable” Functions

this is what i’m talking about! Yippee! Couple it with:

Creativistic Philosophy

Dr. Kurt Ammon has just published his most recent paper on creative systems on the internet. You can find it on

I consider this to be an epoch-making paper.

Basically, the paper contains a proof showing that and in which sense Church’s thesis is wrong. Church’s thesis is a hypothesis that states that every computable function is recursive. In essence this means that every computable function can be described by an algorithm or a finite formal theory. This is often understood to mean that every computer program is an algorithm. Ammon’s paper shows that this is not so. There are programs that are not algorithms and that can develop out of the scope of validity of any given formal theory, computing functions that are not turing-computable. So the generally held assumptions that computable equals turing-computable and that algorithm equals program are wrong.

You can contact Dr. Kurt Ammon on

View original post 4 more words


"A word is a bridge thrown between myself and an other - a territory shared by both" - M. Bakhtin

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s