Ask questions via twitter! Message any question to @answers on twitter. We'll publish the question and send you a reply each time there's a new answer.
Next Question

Answered Question

 
 M¢25  Funded By Mahalo ? |  November 05, 2009 08:47 PM

How could a computer program prove true or false an axiom?

Explain how a computer algorithm would determine, if an axiom is true of false.
Interesting Question?  Yes (0)   No (0)   
RSS
 
 

Best Answer  Chosen by Asker

 
November 05, 2009 09:34 PM
By definition, an axiom is an assumption which can neither be proven nor disproven, and which one makes as the basis of an argument or a construction. No computer program, or person, can thus determine if an axiom is true or false.

For example, Euclidean geometry has a set of axioms (see e.g. http://www.bymath.com/studyguide/geo/sec/geo5.htm ). These axioms can neither be proved nor disproved. If one was to define a space in which one or more of these axioms could be demonstrated to be false, that space would not follow Euclidean geometry. However, that would not mean Euclidean geometry could not be true in a different space.
Asker's Rating:
• What is the purpose of identifying the axiom system?


Helpful Answer?  (2)   (0)   

Helpful: davepamn, docbrown

Tip opher for this answer
Permalink | Report
   Reply  
 
 
 
November 05, 2009 10:06 PM
http://mitworld.mit.edu/video/149

I listening too the lecture by Stephen Wolfram at MIT about cellular automata and towards the end of his lecture, Wolfram started talking about a computer algorithm that could navigate an axiom node and determine true or false assumptions. The axiom network seemed to be very deterministic.

Report
 
 
 
November 05, 2009 10:24 PM
I don't have over an hour and a half to listen to the lecture. However, you can read his blog here: http://blog.wolfram.com/2007/09/11/my-hobby-hunting-for-our-universe/ and get a sense of what he's trying to do (obviously there are nowhere near enough details to assess if his work is even plausible).

From what I read there, he's not claiming to be able to disprove axioms, merely to identify which axiom systems support a particular mathematics (in his blog the example he uses is that the 50,000th axiom system in his enumeration proved to be Boolean logic).

Report
 
 
 
November 06, 2009 03:53 AM
Will you give an example of how a computer algorithm could identify which axiom systems support a particular mathematics?

Report
 
 
 
November 06, 2009 03:58 AM
Wolfram says, "So I started enumerating axiom systems, and trying to discover where in the space of possible axiom systems our familiar areas of mathematics show up."

"One might think this was crazy–like searching for our universe in the space of possible universes."

Is Wolfram connecting axiom systems which relate and calling the network, a searchable binary system?

Report
 
 
 
November 06, 2009 04:13 AM
Due to the site maintenance work I did not see notifications of the further comments until now. To address them briefly, I do not know the purpose of identifying the axiom system, beyond the possibility that Wolfram wanted to know if his algorithm works, and finding the axiomatic basis of Boolean logic supports the possibility that it does. I have no idea what his algorithm is so I cannot venture to answer your other two questions, namely "Will you give an example of how a computer algorithm could identify which axiom systems support a particular mathematics?" and "Is Wolfram connecting axiom systems which relate and calling the network, a searchable binary system?"

Report
 
 
 
November 06, 2009 03:22 PM
Stephen Wolfram proposes:

1. There is complexity in nature. Perhaps, simple algorithms can create a new form of science primitives for understanding nature, as miniature universes of complexity
2. Mathematicians and scientist have used Math to explain nature. For discrete systems math seems to accurately describe nature (the beauty of partial differential equations). However, partial differential equations can be come extremely complex to calculate and discover. Perhaps, it would be better to find a simple algorithm that simulates the behavior of the system.
3. Cellular automa programs have been used to describe complex systems.
4. Other simple programs like binary search, bifurication, fluid dynamics, and Turing machines create complex patterns. Wolfram ran simple programs and observed how they behaved. For rule 110, Wolfram discovered complex random behavior which statistically proved to be random. The simple program had created complicated behavior.
5. Computer languages were designed to help people create primitives to describe what they wanted. Perhaps, there are primitives that describe nature. Language would reflect the rules for describing the natural constructs.

Report
 
 

Answer this Question

How tips and payments work

This question has already been resolved. You may add an answer to it but you will not be eligible to win best answer or any associated tips.

Ask a Question


140 characters left
Top of Page
Buy Mahalo Dollars with Credit Card or PayPal

Top Members

This Week All Time
  • buddawiggi
    buddawiggi
    2nd Degree Black Belt
    26830 Points
    M$782.84 Earned
  • kty2777
    kty2777
    Purple Belt with a Brown Tip
    5313 Points
    M$198.17 Earned
  • opher
    opher
    Purple Belt
    4027 Points
    M$170.67 Earned
   See All
 

Most Popular Tags

mahalo(1581)
iphone(460)
music(458)
google(352)
food(313)
online(292)
beer(278)
money(262)
movies(254)
apple(249)
aotd(235)
health(217)
video(201)
free(201)
dog(200)
   See All
 

Categories

Welcome New Members


 
 
Mahalo Dollars are the currency of Mahalo Answers.

Each Mahalo Dollar costs $1.

Once you earn more than 40 Mahalo Dollars, you can request to be paid via PayPal. Each Mahalo Dollar is currently worth $0.75 when paid out via PayPal. Learn More

 
 

Please log in to use this function.