Are we more than Turing machine?

  • Thread starter Thread starter STT
  • Start date Start date
Status
Not open for further replies.
S

STT

Guest
Turing machine is very simple machine. It has an endless tape with two type of symbols. It has an algorithm which allows to erase and wright the symbols on the tape. Alonzo Church showed that any algorithmic problem can be solved by Turing machine. Can you give me an example of a problem which is not algorithmic? If not we are simple Turing machine.
 
A Turing Machine doesn’t understand. The ones and zeroes/states are meaningless without a mind to understand them. It’s the problem of intentionality. Algorithms with meaning are programmed into it. Solutions with meaning are read out of it. But no meaning actually exists in the language itself apart from a mind that assigns it meaning.
 
You can give yourself lots of examples, within all the many Big Questions.

You need to read more widely, beyond those who fancy themselves qualified to speak about “mind”, and respect your own mind more.

(Like most people you were probably taught to be ashamed of your mind.)

Algorithm: people who look behind themselves are paranoid. Agreed?

Aha but people with a certain kind of nerve damage need to look to know what’s going on around them. NLP-like doctrines (algorithms) teach that those people are paranoid but those doctrines fall down.
 
A Turing Machine doesn’t understand. The ones and zeroes/states are meaningless without a mind to understand them. It’s the problem of intentionality. Algorithms with meaning are programmed into it. Solutions with meaning are read out of it. But no meaning actually exists in the language itself apart from a mind that assigns it meaning.
Another thing is that life doesn’t come in absolutes, it comes in approximations.

Initiative is also crucial.

Please discover, in yourself, initiative, tastes, gifts.
 
A Turing Machine doesn’t understand. The ones and zeroes/states are meaningless without a mind to understand them. It’s the problem of intentionality. Algorithms with meaning are programmed into it. Solutions with meaning are read out of it. But no meaning actually exists in the language itself apart from a mind that assigns it meaning.
I know that Turing machine is not conscious. My question is whether we are Truing machine when it comes to solving problem? I already asked: Do you know a problem which is solved non-algorithmically?
 
You can give yourself lots of examples, within all the many Big Questions.

You need to read more widely, beyond those who fancy themselves qualified to speak about “mind”, and respect your own mind more.

(Like most people you were probably taught to be ashamed of your mind.)

Algorithm: people who look behind themselves are paranoid. Agreed?

Aha but people with a certain kind of nerve damage need to look to know what’s going on around them. NLP-like doctrines (algorithms) teach that those people are paranoid but those doctrines fall down.
Do you know any problem which is solved non-algorithmically?
 
I know that Turing machine is not conscious. My question is whether we are Truing machine when it comes to solving problem? I already asked: Do you know a problem which is solved non-algorithmically?
This feels like a John Henry vs the Machine type of question. Depending on the problem a computer (Turing machine) may probably work better. There’s a bit of a movement right now of maximizing use of AI to reduce the need for humans for certain tasks and problems. Though there may still be people involved at some higher level member of the process. But a significant number of people may have been eliminated.
 
Do you know any problem which is solved non-algorithmically?
If you’re reading up on Turing machines, you’ll find the notion of the “halting problem”. In other words, I could ask you the question “can you come up with an algorithm that could take another algorithm as (name removed by moderator)ut and determine whether that algorithm will eventually find a solution and halt on all (name removed by moderator)uts given to it?”.

Turing proved that this problem cannot be solved algorithmically: there is no program which can make this determination for all algorithms and all (name removed by moderator)uts. This isn’t the only undecidable problem out there, though; there are many others.

I don’t know if this helps, though: it’s not that the halting problem is “solved non-algorithmically”, it’s that it’s “non-solvable algorithmically.” There’s an important difference there, of course.
 
This feels like a John Henry vs the Machine type of question. Depending on the problem a computer (Turing machine) may probably work better. There’s a bit of a movement right now of maximizing use of AI to reduce the need for humans for certain tasks and problems. Though there may still be people involved at some higher level member of the process. But a significant number of people may have been eliminated.
Thanks for the complement.
 
If you’re reading up on Turing machines, you’ll find the notion of the “halting problem”. In other words, I could ask you the question “can you come up with an algorithm that could take another algorithm as (name removed by moderator)ut and determine whether that algorithm will eventually find a solution and halt on all (name removed by moderator)uts given to it?”.

Turing proved that this problem cannot be solved algorithmically: there is no program which can make this determination for all algorithms and all (name removed by moderator)uts. This isn’t the only undecidable problem out there, though; there are many others.

I don’t know if this helps, though: it’s not that the halting problem is “solved non-algorithmically”, it’s that it’s “non-solvable algorithmically.” There’s an important difference there, of course.
Thanks for your response. Could we solve undecidable problems? Our brains mainly process information in parallel. Could that be the source of difference between us and Turing machine? Please read the following article.
 
Could we solve undecidable problems?
The issue with the “halting problem” is that you can’t predict, over all sets of (name removed by moderator)uts, whether the program will halt… until you actually run all sets of (name removed by moderator)uts. So, you ‘solve’ it by actually doing it.
Our brains mainly process information in parallel. Could that be the source of difference between us and Turing machine?
I don’t think so. After all, our brains seem to be more like groups of processing cores operating in parallel. If we set up a bunch of Turing machines, working in parallel (and coordinated in some fashion), wouldn’t we have the same effect?
Please read the following article.
Hmm… that guy comes off as pretty angry with the world. Hard to collaborate when you take an attitude like that…
 
The issue with the “halting problem” is that you can’t predict, over all sets of (name removed by moderator)uts, whether the program will halt… until you actually run all sets of (name removed by moderator)uts. So, you ‘solve’ it by actually doing it.
Why should we have done that if the theory is proven.
I don’t think so. After all, our brains seem to be more like groups of processing cores operating in parallel. If we set up a bunch of Turing machines, working in parallel (and coordinated in some fashion), wouldn’t we have the same effect?
Yes. Something like that.
Hmm… that guy comes off as pretty angry with the world. Hard to collaborate when you take an attitude like that…
You can google it yourself.
 
Why should we have done that if the theory is proven.
Exactly. Since we can’t do anything but run the algorithms themselves, there’s no point in attempting to instantiate a “halting algorithm”.
You can google it yourself.
Google what? That the guy hates academia and computer scientists? He claimed it right on the blog you cited.
 
Our brains mainly process information in parallel. Could that be the source of difference between us and Turing machine? Please read the following article.
Hmmm, that guy says he is “a self-taught computer programmer” and it shows. He doesn’t seem to understand much.

Strictly speaking, a Turing machine only has one processor, but parallel processors are Turing equivalent - they do what a Turing machine does but quicker.

A GPU is massively parallel, and they have evolved into computers for self-driving cars executing trillions of instructions per second - nvidia.com/object/drive-px.html

They use neural networks, which are a simplified model of how our brains work. Neural networks can run on a Turing machine.

Turing wrote a paper about whether we could distinguish between a human and an intellgent machine - google “Turing test”.
 
Turing wrote a paper about whether we could distinguish between a human and an intellgent machine - google “Turing test”.
Alan Turing was an amazing guy. He did both things – and many more! – in his career. The “Turing test” is distinct from the notion of a “Turing machine,” though.
 
Alan Turing was an amazing guy. He did both things – and many more! – in his career. The “Turing test” is distinct from the notion of a “Turing machine,” though.
Yes, amazing guy. He described what became known as the universal Turing machine way back in 1936 - cs.virginia.edu/~robins/Turing_Paper_1936.pdf

His 1950 paper asking ‘Can machines think?’ contains a less technical description along with what later became called the Turing test. He devotes half the paper to describing the universal computing machine, presumably because the idea was still so new to many of his readers. - csee.umbc.edu/courses/471/papers/turing.pdf
 
Status
Not open for further replies.
Back
Top