November 2007 Archives by date

• Messages sorted by: [ thread ] [ subject ] [ author ]
• More info on this list...

Starting: Thu Nov 1 04:51:52 EDT 2007
Ending: Fri Nov 30 06:28:19 EDT 2007
Messages: 158

• [FOM] Simple Turing machines, Universality, Encodings, etc.   Alexander Smith
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Alexander Smith
• [FOM] regular expressions   Adam Kolany
• [FOM] Simple Turing machines, Universality, Encodings, etc.   James Harland
• [FOM] regular expressions   Adam Kolany
• [FOM] Verifying or Falsifying The Principle of Computational Equivalence   Kovas Boguta
• [FOM] regular expressions   Vaughan Pratt
• [FOM] Smallest universal machine   Hector Zenil
• [FOM] Smallest universal machine   Vaughan Pratt
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Rob van Glabbeek
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Rob van Glabbeek
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Vaughan Pratt
• [FOM] Might there be no inaccessible cardinals?   Vaughan Pratt
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Alexander Smith
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Richard Heck
• [FOM] Might there be no inaccessible cardinals?   Rupert McCallum
• [FOM] Might there be no inaccessible cardinals?   Kenny Easwaran
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Andrej Bauer
• [FOM] Might there be no inaccessible cardinals?   Kaveh Ghasemloo
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Kreinovich, Vladik
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Andrej Bauer
• [FOM] Simple Turing machines, Universality, Encodings, etc.   FL
• [FOM] FW: Simple Turing machines, Universality, Encodings, etc.   Kreinovich, Vladik
• [FOM] Query on nonstandard models of the integers   joeshipman at aol.com
• [FOM] The discrete and the continuous   Thomas Forster
• [FOM] Simple Turing machines, Universality, Encodings, etc.   Bruno Loff
• [FOM] Query on nonstandard models of the integers   Joachim Reineke
• [FOM] The discrete and the continuous   William Tait
• [FOM] The discrete and the continuous   hendrik at topoi.pooq.com
• [FOM] Reply to Smith on Universality   joeshipman at aol.com
• [FOM] Query on nonstandard models of the integers   Gyorgy Sereny
• [FOM] Query on nonstandard models of the integers   joeshipman at aol.com
• [FOM] The discrete and the continuous   A. Mani
• [FOM] Query on nonstandard models of the integers   joeshipman at aol.com
• [FOM] Benenson   Robert Black
• [FOM] Question on axiomatizations   Michael Sheard
• [FOM] 310:Thematic PA Incompleteness 2   Harvey Friedman
• [FOM] Paper announcement: Categorical Models of Classical Logic and GoI   David Pym
• [FOM] Query on nonstandard models of the integers   A J Franco de Oliveira
• [FOM] Benenson   Timothy Y. Chow
• [FOM] Benenson   Jay Sulzberger
• [FOM] the power of nonconstructive reasoning   Gabriel Stolzenberg
• [FOM] Q and A   Gabriel Stolzenberg
• [FOM] Q and A (nonstandard analysis)   Martin Davis
• [FOM] replies to two nonstandard postings   David Ross
• [FOM] Q and A   joeshipman at aol.com
• [FOM] 2,3 Turing machine proof controversy   Alexander Smith
• [FOM] note to subscribers from the moderator   Martin Davis
• [FOM] non-Euclidean geometry and FOM programs   Antonino Drago
• [FOM] Q and A   Kreinovich, Vladik
• [FOM] Tarski's real projective geometry   Neil Tennant
• [FOM] 2,3 Turing machine proof controversy   Clive Gifford
• [FOM] Tarski's real projective geometry   Kreinovich, Vladik
• [FOM] Intuitionism and 0=1   Robert Black
• [FOM] 311:Thematic PA Incompleteness 3   Harvey Friedman
• [FOM] Tarski's real projective geometry   John Baldwin
• [FOM] 2,3 Turing machine proof controversy   Kreinovich, Vladik
• [FOM] Intuitionism and 0=1   Vaughan Pratt
• [FOM] 2,3 Turing machine proof controversy   Alex Galicki
• [FOM] 2,3 Turing machine proof controversy   Alexander Smith
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] constructive cauchy   Gabriel Stolzenberg
• [FOM] constructive cauchy   S. S. Kutateladze
• [FOM] 2,3 Turing machine proof controversy   Alex Galicki
• [FOM] 2,3 Turing machine proof controversy   Alex Galicki
• [FOM] 2,3 Turing machine proof controversy   Alexander Smith
• [FOM] non-Euclidean geometry and FOM programs   andre rodin
• [FOM] 2,3 Turing machine proof controversy   Bob Hearn
• [FOM] Re the future of history   Gabriel Stolzenberg
• [FOM] Re the future of history   Robert L Knighten
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] Beltrami and non-Euclidean geometry   Alasdair Urquhart
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] Algebra and Ramsey Type Theorems   A. Mani
• [FOM] Historical queries   joeshipman at aol.com
• [FOM] 2,3 Turing machine proof controversy   Alex Galicki
• [FOM] nonconstructive proofs   Harvey Friedman
• [FOM] a taxonomy to help with 2-3 controversies   Thomas Lord
• [FOM] Historical queries   Wayne Aitken
• [FOM] 2,3 Turing machine proof controversy   Clive Gifford
• [FOM] Historical queries   joeshipman at aol.com
• [FOM] 2,3 Turing machine proof controversy   joeshipman at aol.com
• [FOM] Historical queries   Alasdair Urquhart
• [FOM] Re the future of history   S. S. Kutateladze
• [FOM] Historical queries   William Tait
• [FOM] Transfinite Euclidean Algorithm   joeshipman at aol.com
• [FOM] Re the future of history   Gabriel Stolzenberg
• [FOM] FOM Digest, Vol 59, Issue 18   David Ross
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] Halting rules for the 2,3 and a 2,4 Turing machine   Alexander Smith
• [FOM] Transfinite Euclidean Algorithm   hendrik at topoi.pooq.com
• [FOM] Algebra and Ramsey Type Theorems   A. Mani
• [FOM] Historical queries   joeshipman at aol.com
• [FOM] 312: Pi01 Incompleteness   Harvey Friedman
• [FOM] Universality for unbounded computations   Todd Rowland
• [FOM] 2,3 Turing machine proof controversy   Robert Smith
• [FOM] Principle of Computational Equivalence   Bill Taylor
• [FOM] Correction: Halting rules for the 2, 3 and a 2, 4 Turing machine   Alexander Smith
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] Transfinite Euclidean Algorithm   joeshipman at aol.com
• [FOM] Historical queries   joeshipman at aol.com
• [FOM] Historical queries   Alasdair Urquhart
• [FOM] Transfinite Euclidean Algorithm   Vaughan Pratt
• [FOM] Universality for unbounded computations   Vaughan Pratt
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] reply to s.s. kuteladze   Gabriel Stolzenberg
• [FOM] re re re the future of history   Gabriel Stolzenberg
• [FOM] re re re the future of history   S. S. Kutateladze
• [FOM] History of Fundamental Theorem of Arithmetic   joeshipman at aol.com
• [FOM] Transfinite Euclidean Algorithm   hendrik at topoi.pooq.com
• [FOM] non-Euclidean geometry and FOM programs   Antonino Drago
• [FOM] 2,3 Turing machine proof controversy   TURLOUGH NEARY
• [FOM] reply to s.s. kuteladze   S. S. Kutateladze
• [FOM] UFD example?   joeshipman at aol.com
• [FOM] 2,3 Turing machine proof controversy   Vaughan Pratt
• [FOM] CiE08 - 2nd Call for Papers   Arnold Beckmann
• [FOM] Ancient History   Allen Hazen
• [FOM] non-Euclidean geometry and FOM programs   andre rodin
• [FOM] UFD example?   Messing
• [FOM] UFD example?   Timothy Y. Chow
• [FOM] Archimedes's "Method"   Alasdair Urquhart
• [FOM] UFD example?   Wayne Aitken
• [FOM] UFD example?   Joachim Reineke
• [FOM] Principle of Computational Equivalence   Kovas Boguta
• [FOM] 2,3 Turing machine proof controversy   Bob Hearn
• [FOM] UFD example   joeshipman at aol.com
• [FOM] Archimedes's "Method"   S. S. Kutateladze
• [FOM] UFD example   Joachim Reineke
• [FOM] Fuzzy or Extensible? On ill-defined Concepts   laureano luna
• [FOM] Prenex   Thomas Forster
• [FOM] non-Euclidean geometry and FOM programs   Antonino Drago
• [FOM] Universality for unbounded computations   Todd Rowland
• [FOM] Principle of Computational Equivalence   Todd Rowland
• [FOM] 2,3 Turing machine proof controversy   Todd Rowland
• [FOM] Principle of Computational Equivalence   Thomas Lord
• [FOM] UFD Example   Dave Marker
• [FOM] Nested-universality   Alexander Smith
• [FOM] the ultimate aim of mathematics etc.   Gabriel Stolzenberg
• [FOM] the ultimate aim of mathematics etc.   S. S. Kutateladze
• [FOM] 2,3 Turing machine proof controversy   Tjark Weber
• [FOM] Prenex   Alberto Marcone
• [FOM] Prenex   Sara L. Uckelman
• [FOM] Prenex   laureano luna
• [FOM] Prenex (Thomas Forster)   Rafal Urbaniak
• [FOM] Proof and open source software   Jay Halcomb
• [FOM] TAMC 2008: extension of submission deadline   S B Cooper
• [FOM] Prenex   Thomas Forster
• [FOM] Prenex   Richard Zach
• [FOM] Prenex   Max Weiss
• [FOM] Prenex   Max Weiss
• [FOM] constructive Tychonov   Robert Black
• [FOM] constructive Tychonov   Andrej Bauer
• [FOM] constructive Tychonov   Andrej Bauer
• [FOM] constructive Tychonov   negri at mappi.helsinki.fi
• [FOM] constructive Tychonov   Stephen G Simpson
• [FOM] VIG 2008 at UCLA   H. Enderton
• [FOM] constructive Tychonov   gcuri at math.unipd.it

Last message date: Fri Nov 30 06:28:19 EDT 2007
Archived on: Fri Nov 30 09:19:28 EDT 2007

• Messages sorted by: [ thread ] [ subject ] [ author ]
• More info on this list...