Home | Contact Us | FAQ | Search & Site Map | Link to Us
Sign In | Join | Other 45 Sites in Network
Home
Discussion Groups
Mathematics
General TopicsResearchOperations ResearchStatisticsMathematical LogicNumerical AnalysisUndergraduate MathAlgebra HelpRecreational Math
Math Software
MapleMathematicaMATLABScilabSASSPSS

Math Forum / Mathematics / Mathematical Logic / June 2004



Tip: Looking for answers? Try searching our database.

ThreadLast Post  Replies
Aleph nought is finite30 Jun 2004 23:15 GMT47
According to Cantor, the natural numbers have an order of infinite magnitude
less than that of the real numbers because the real numbers can not be
exhaustively paired, one-to-one, with any list of natural numbers.
Conversely, this means that the real numbers must be able to exhaust ...
Commercial Applications of Logic30 Jun 2004 22:18 GMT2
I would welcome any suggestions for commercial applications of first
order logic. Assume one has an efficient, completely automated first
order logic theorem prover. Assume also that the theorem prover can
also be used to do queries for individuals that satisfy a query
Re: Alan Turing's Halting Problem is Incorrect (PART-THREE)30 Jun 2004 20:22 GMT71
PREMISES:
(1) The Halting Problem was defined to have no possible correct
answer. In other words it's an IMPOSSIBLE QUESTION.
function LoopIfHalts (bool YouSayItHalts):
Deep Thoughts # 7: A New Kind of Mathematics30 Jun 2004 16:00 GMT72
Mathematicians notice intuitive phenomena and attempt to write axioms
to describe them.  These "axioms" are said to be arbitrary and their
syntax is often studied independent of their semantics.  However, they
are not arbitrary - they are chosen to reflect the properties of the
Alan Turings halting proof is incorrectly formed PT Herc30 Jun 2004 15:51 GMT18
As Peter originally put it, the output of halt should reasonably be
expected to have 3 options :
1 /  the input halts
2 /  the input wont halt
Speaking of halting in C++ ...30 Jun 2004 13:08 GMT1
Here's something that probably is of interest only to those interested in
the gory details of computer programming.
So, I'm writing an interface to Bruce Schneier's Blowfish encryption
algorithm.  It's pretty straightforward and I've done it before, but I want
Alan Turing's Halting Problem is incorrectly formed (PART-TWO)30 Jun 2004 10:17 GMT360
Below is the link from which I am basing my discussion.
http://www.netaxs.com/people/nerp/automata/halting2.html
Because of all of the dialogue of the other threads on this
subject I am able to state my position much more clearly.
New Zealand's Yoko Site30 Jun 2004 01:16 GMT1
    www.kia-ora-yoko.co.nz
    A site dedicated to the ultimate logician!
Immortality and the size of your head29 Jun 2004 16:38 GMT16
I posted before that I recall that original Scientology, as founded by
L. Ron Hubbard, did not just contain a route to obtain spiritual
freedom but also a route to stop aging, actually to become immortal
with the body. Many people think it can't be true, but when people
Who blows the whistle is being discredited29 Jun 2004 00:28 GMT2
The old corrupt story, who blows the whistle is being discredited, and
when they are even more unlucky, committed to a psychiatric
institution and mishandled till they can't speak out anymore.
Scientists who persisted in publicly raising the issue of harmful
deception28 Jun 2004 18:24 GMT16
if it is possible to be deceived once, why is it not possible to be deceived all
the time?
Exists one and only one28 Jun 2004 08:34 GMT12
hi.  i read abou the E!x|P(x) notation which means "there exists one
and only one x such that P(x)"  I got curious about how to negate it
so I tried to rewrite it as:
E!x|P(x) <-> Ex|{P(x) AND [Ay,P(y) -> (y=x)]}  "Ay means 'for all y'"
Why?27 Jun 2004 06:01 GMT2
T ='consciousness' in a cross between physics & languages ?
:)
N
Is a socalled natural death really "natural"?27 Jun 2004 00:16 GMT24
Secret services know how to make you sick and kill you from a distance
since a very long time. Try to catch the killers miles away!
So, next time you feel sick or drop dead, you might be the victim of a
crime. Law enforcement and the people in general have to know that,
proof checker - problems24 Jun 2004 18:45 GMT6
I hope, I'm right in this NG.
I'm desperately trying to prove the following tautology:
(Phi => (Psi => Chi)) => (Psi => (Phi => Chi))
I wrote the following "tutch"-program for this:
Pages: 1 2 3 4 5 May, 2004
 
Sign In
Join
My Latest Posts
My Monitored Threads
My Blog
My Photo Gallery
My Profile
My Homepage

Start New Thread



©2009 Advenet LLC   Privacy Policy - Terms of Use
This website includes both content owned or controlled by Advenet as well as content owned or controlled by third parties.