Can Turing Machines Understand Infinity?

In summary: Undecidable means that there is no general algorithm that can determine if a given problem is decidable or not. Undecidable problems are those that have no finite or infinite solution, and this includes problems in systems of logic.
  • #1
Gear300
1,213
9
I had a conversation with someone once upon a time (it was quite a while back actually), and we came to the question of whether or not Turing machines could ever understand infinity. We agreed that we as humans are intimate with the extant and divisible infinities mainly through our sensory-perception, and more generally, we are able to grasp at analytic continuation. Although, computers work in modulo math and can only count up to the number of bits of information they can hold. Any opinions? Has there ever been any literature on this?
 
Physics news on Phys.org
  • #2
What does "understand infinity" mean? Which output to which input corresponds to an understanding?

As Turing machines can in principle simulate a human brain: Do we "understand infinity"? If yes Turing machines can do so as well.
 
  • Like
Likes nomadreid
  • #3
In my view to understand infinity means to know when to stop because looping forever would serve no purpose.

The problem with computing machines is that they can’t always know when to halt and thus are doomed to keep working a problem forever. It’s known as the halting problem and Turing proved that there is no general algorithm that can determine if a given program will halt or not.

https://en.m.wikipedia.org/wiki/Halting_problem

In any event, all halting problem answers are best summed up as 42, he said humorously. :-)

https://en.m.wikipedia.org/wiki/Phrases_from_The_Hitchhiker's_Guide_to_the_Galaxy#Answer_to_the_Ultimate_Question_of_Life,_the_Universe,_and_Everything_(42)
 
  • Like
Likes Janosh89
  • #4
undecidable = irresolute?? Or does the latter have other connotations?
 
  • #5
Gear300 said:
I had a conversation with someone once upon a time (it was quite a while back actually), and we came to the question of whether or not Turing machines could ever understand infinity. We agreed that we as humans are intimate with the extant and divisible infinities mainly through our sensory-perception, and more generally, we are able to grasp at analytic continuation. Although, computers work in modulo math and can only count up to the number of bits of information they can hold. Any opinions? Has there ever been any literature on this?

Well, you don't need infinite resources in order to reason about infinite objects. We can prove things about the natural numbers and the reals, etc., using finitely many axioms.
 
  • Like
Likes nomadreid
  • #6
Gear300 said:
we as humans are intimate with the extant and divisible infinities mainly through our sensory-perception
Ah? How do our senses record infinities? When is the last time you saw, smelled, touched, tasted, or heard an inaccessible cardinal?
 
  • #7
jedishrfu said:
In my view to understand infinity means to know when to stop because looping forever would serve no purpose.

The problem with computing machines is that they can’t always know when to halt and thus are doomed to keep working a problem forever. It’s known as the halting problem and Turing proved that there is no general algorithm that can determine if a given program will halt or not.

But humans aren't any better. For problems like the Riemann hypothesis or Goldbach's conjecture, they may never know whether eventually they will prove them or refute them, or neither. They never know when to give up. Except when they get hungry or bored.
 
  • Like
Likes jedishrfu and nomadreid
  • #8
nomadreid said:
Ah? How do our senses record infinities? When is the last time you saw, smelled, touched, tasted, or heard an inaccessible cardinal?

We had a few in my yard. We could see them feeding but we couldn't touch as they were too skittish and flew away at the slightest sound.
 
  • Like
Likes nomadreid
  • #9
stevendaryl said:
But humans aren't any better. For problems like the Riemann hypothesis or Goldbach's conjecture, they may never know whether eventually they will prove them or refute them, or neither. They never know when to give up. Except when they get hungry or bored.

This is all true but sometimes we get lucky and discover Godel who's shown us that there are always undecidable statements in any system of logic and knowing that will give us pause. Also we can get tired or die from exhaustion and infinity becomes more infinite while others laugh at our folly.
 
Last edited:
  • #10
jedishrfu said:
This is all true but sometimes we get lucky and discover Godel who's shown us that there are always undecidable statements in any system of logic.
First, far from "any" system of logic, but that is nit-picking. The more important point is that Gödel (Turing, Rosser, etc.) pointed out how to generate a few undecidables, and a few specific examples were pointed out (Cohen and Gödel, Matiyasevich et al, etc.), but unless a given problem fits into this list (modulo isomorphism or as a problem requiring the solution of an undecidable), or has been proven or disproven, or is part of a system in which all problems are decidable, there is no general procedure to tell if a given problem is undecidable. So we are back to square one, with machines and humans theoretically having the same problems.
 
  • #11
nomadreid said:
First, far from "any" system of logic, but that is nit-picking. The more important point is that Gödel (Turing, Rosser, etc.) pointed out how to generate a few undecidables, and a few specific examples were pointed out (Cohen and Gödel, Matiyasevich et al, etc.), but unless a given problem fits into this list (modulo isomorphism or as a problem requiring the solution of an undecidable), or has been proven or disproven, or is part of a system in which all problems are decidable, there is no general procedure to tell if a given problem is undecidable. So we are back to square one, with machines and humans theoretically having the same problems.

You are back to square one, I am perfectly fine running in my hamster cage at work. :-)
 
  • #12
jedishrfu said:
I am perfectly fine running in my hamster cage at work.
Philip Dick wrote a short story "The Infinities" in which hamsters evolve into pure energy and zap a meanie human. Maybe you are on your way :bang:
 
  • Like
Likes jedishrfu
  • #13
nomadreid said:
Philip Dick wrote a short story "The Infinities" in which hamsters evolve into pure energy and zap a meanie human. Maybe you are on your way :bang:

No, more likely to be attacked by the hamsters for maligning them and their wheel here.
 
  • #14
nomadreid said:
Ah? How do our senses record infinities? When is the last time you saw, smelled, touched, tasted, or heard an inaccessible cardinal?

"I saw no God, nor heard any, in a finite organical perception; but my senses discover'd the infinite in every thing ..."
William Blake
 
  • Like
Likes jedishrfu
  • #15
  • Like
Likes PeroK

1. Can a Turing Machine compute an infinite sequence?

No, a Turing Machine can only compute a finite number of steps. It cannot process infinite sequences as it would require an infinite amount of time and memory.

2. Can a Turing Machine understand infinite sets?

No, a Turing Machine can only understand and process finite sets. It cannot comprehend the concept of infinity.

3. Can a Turing Machine solve problems involving infinity?

No, a Turing Machine is limited to solving problems that can be represented by a finite number of steps. It cannot handle problems involving infinite steps or processes.

4. Can a Turing Machine simulate an infinite loop?

No, a Turing Machine can only perform a finite number of steps. It cannot simulate an infinite loop as it would require an infinite amount of time and memory.

5. Can a Turing Machine be modified to understand infinity?

No, the concept of infinity is beyond the capabilities of a Turing Machine. It cannot be modified to understand or process infinite values or sequences.

Similar threads

Replies
2
Views
913
  • Programming and Computer Science
Replies
29
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
6
Views
2K
  • Programming and Computer Science
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
4
Views
2K
Replies
1
Views
2K
  • General Discussion
Replies
1
Views
3K
  • Programming and Computer Science
Replies
9
Views
1K
  • Quantum Interpretations and Foundations
Replies
32
Views
2K
Back
Top