Theory
in [Programming]
|
Can anyone explain this quote? "If the human brain were so simple That we could understand it, We would be so simple That we couldn't." Emerson M. Pugh ... 19 Dec 2005 13:10
----------------------------------- U ----------------------------------------------------------------------------------- U is the complete set of all non-historical true facts, and formalism of all mathematics, and it doesn't blow up when it inputs "this has no proof" because only proven facts are considered true. Herc disputing Godels Incompleteness Theorem ... 10 Oct 2005 19:40
proper deletion algorithm for Patricia trie I have been working on a Patricia trie implementation for storing counts of version 4 IP addresses. When the count reaches 0, I need to delete the node. I am using a variant that contains no NULL links. The deletion cases I think I need to handle are: 1. node has left and right pointers that point up to the... 24 Aug 2005 17:48
are Real Numbers evil? Are anyone out there who has wished mathematics has never had invented real numbers because they are nothing else as a try to generate infinite confusion? If yes, I would be thankful to hear about the details. Are there any alternative mathematics suitable to describe movement (especially rotation) in 3D s... 5 Jul 2005 17:56
Software for "Regular Expression" <=> NFA <=> DFA Hello all, as I'm attending a course that deals heavily with Regular Expressions / DFA / NFA this term and was wondering if there are any software tools out there that support working with these concepts especially converting one into the other. I googled quite a lot but couldn't find anything appropriate. An... 17 May 2005 08:49
NFA or DFA? I was playing around with JFLAP (JFLAP is a package of graphical tools which can be used as an aid in learning the basic concepts of Formal Languages and Automata Theory - http://www.cs.duke.edu/~rodger/tools/jflap/) I construct what I think is a simple NFA (Q, Sigma, delta, q0, F) where Q = {q0, q1} Sig... 24 Feb 2005 10:25
does sqrt(2) exist in CM? Does Sqrt(2) exist in Constructive Mathematics? Proofs have to be finite AIUI, so unless we artificially augment the postulated objects, irrational numbers do not exist in CM. ... 24 Feb 2005 10:26
Name the thesis: "Formal sentences capture informal ones" The Church-Turing thesis is familiar to many people, largely because it has been widely discussed both in textbooks and in popular science writing. Having a name helps, too. There is an analogous thesis that is relevant to logic and the foundations of mathematics: (*) Formal sentences (in PA or ZFC for exam... 14 Feb 2005 19:28
Herc defines the HOLY GRAIL OF MATHEMATICS http://mathworld.wolfram.com/ChaitinsConstant.html o = sum 2^(-|p|) (p halts) |p| is the size in bits of program p. Note: if ALL programs halt, 2 programs of size 1 4 programs of size 2 8 programs of size 3 omega = 1/2 + 1/2 + 1/4 + 1/4 + 1/4 + 1/4 + 1/8 + 1/8 + 1/8 + 1/8 + 1/8 + 1/8 + 1/8 + 1/8 .... 14 Feb 2005 19:28
higher-order logic I'm interested in learning more about higher-order logic: its computational aspects, inference and learning algorithms, and perhaps uncertainty representation. The books on higher-order logic that I found appear to actually be tutorials on using specific proof assistance software products (HOL or Isabelle), whic... 14 Feb 2005 19:28 |