These programs can then be expanded to test very complex integer sequences or even create these sequences by themselves. As Hofstadter wrote he challenged himself with building a thinking machine that would be able to preform such a task for a wide variety of integer sequences. The concept behind building a thinking machine is one that needs a lot of planning and forethought, and one that needs to be refined over time. Eventually though a machine could be build, a program could be written that would calculate a large number of recursive integer sequences. If a machine can be "taught to think" in this fashion, could it to be taught to preform more complex tasks and even emulate human intelligence?
Monday, September 7, 2009
Fluid Concepts 1-35
For much of these first pages Hofstadter writes about integer sequences. I found this interesting, in particular, the idea that these sequences could possibly be recursive, or describe themselves. He also writes about how computer programs can be developed to test whether these recursive structures hold true out to thousands or even hundreds of thousands of integers. I think that this is a really cool idea and I would like to program such a script. Possibly by using the Prolog language, as it is particularly good at recursion.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment