Replying to a comment on:

It's Time (Lyric) by PoeticXTC

It's time that makes us It's time which breaks us It's time we take responsiblity at hand. It's time that fakes us It's time which takes us It's time we all make a stand. It's time that heals us It's time which kills us It's time we find a cure. It's time that fills us it's time which steals us It's time we should all mature. It's time that fails us It's time which bails us It's time we survive on our own. It's time that hails us It's time which sells us It's time we should not be alone. It's time that finds us It's time which binds us It's time we come together as one. It's time that minds us It's time which blinds us It's time we light the way for the sun. It's time that sold us It's time which holds us It's time we put our dreams in range. It's time that molds us It's time which olds us It's time we give our lives a change. It's time that makes us It's time which breaks us It's time that fakes us It's time which takes us It's time that fills us It's time which steals us It's time that heals us It's time which kills us It's time that fails us It's time which bails us It's time that hails us It's time which sells us It's time that finds us It's time which binds us It's time that minds us It's time which blinds us It's time that sold us It's time which holds us It's time that molds us It's time which olds us It's time that we stop making excuses for our downfalls. It's time which we start making a reality of it all. It's time we stop blaming time, for wasted, on time we do not have. It's Time... It's Time!

-=Dark_Angel=-, P.I. 29-Dec-05/5:13 PM
When you say 'deduce everything else' what do you mean? Do you mean deduce all true statements? It can be easily proven that there exist functions which are uncomputable (i.e. for any such function f there is no algorithm* to compute f(x) for all x in the domain). One such function is the function H that maps any computer program P, and input data D, to True or False, depending
on whether P halts on input D, or loops forever on input D:

i.e. H(P, D) = True if and only if program P halts on input D.

The upshot of all this is that there are true statements that are undeducible. Clearly any machine that could 'deduce everything' would have to accept these statements as given. There are infinite such statements. So there is no finite upper bound on the minimum you'd have to program a supersupercomputer to deduce everything. The interested reader is encouraged to have a look at http://en.wikipedia.org/wiki/Halting_problem

* Caveat: by 'algorithm' I mean 'Turing machine'. This covers all algorithms (and a lot more) that can be written on any computer, in any language, today. There might be an as yet undiscovered magical means of computation that could solve such problems, but if such a means exists, only Jesu would know about it, and it would be His little secret.




Track and Plan your submissions ; Read some Comics ; Get Paid for your Poetry
PoemRanker Copyright © 2001 - 2024 - kaolin fire - All Rights Reserved
All poems Copyright © their respective authors
An internet tradition since June 9, 2001