Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #507843 > unrolled thread
| Started by | David Petry <davidlpetry@gmail.com> |
|---|---|
| First post | 2020-12-23 19:57 -0800 |
| Last post | 2021-01-08 14:22 -0600 |
| Articles | 20 on this page of 103 — 15 participants |
Back to article view | Back to sci.math
A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-23 19:57 -0800
Re: A very brief history of mathematics Peter <peterxpercival@hotmail.com> - 2020-12-24 08:20 +0000
Re: A very brief history of mathematics Dan Christensen <Dan_Christensen@sympatico.ca> - 2020-12-24 04:32 -0800
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-24 09:56 -0800
Re: A very brief history of mathematics Dan Christensen <Dan_Christensen@sympatico.ca> - 2020-12-24 10:52 -0800
Re: A very brief history of mathematics FredJeffries <fredjeffries@gmail.com> - 2020-12-25 10:17 -0800
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-25 13:01 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-25 15:42 -0600
Re: A very brief history of mathematics Python <python@python.invalid> - 2020-12-25 22:50 +0100
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-25 19:26 -0800
Re: A very brief history of mathematics Jim Burns <james.g.burns@att.net> - 2020-12-25 17:38 -0500
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-25 19:25 -0800
Re: A very brief history of mathematics Jim Burns <james.g.burns@att.net> - 2020-12-26 00:55 -0500
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-26 10:38 -0800
Re: A very brief history of mathematics Jim Burns <james.g.burns@att.net> - 2020-12-27 15:41 -0500
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-28 06:05 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-26 08:00 -0600
Re: A very brief history of mathematics Peter <peterxpercival@hotmail.com> - 2020-12-26 05:50 +0000
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-26 10:41 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2020-12-26 19:50 +0100
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-26 12:58 -0600
Re: A very brief history of mathematics Peter <peterxpercival@hotmail.com> - 2020-12-26 20:21 +0000
Re: A very brief history of mathematics FromTheRafters <erratic@nomail.afraid.org> - 2020-12-26 16:38 -0500
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-27 11:19 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2020-12-27 20:21 +0100
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-27 11:35 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-27 14:04 -0600
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2020-12-28 01:46 -0800
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-28 06:11 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-28 08:26 -0600
Re: A very brief history of mathematics lk <lk@lk.lk> - 2020-12-28 16:48 +0000
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-28 12:19 -0600
Re: A very brief history of mathematics Peter <peterxpercival@hotmail.com> - 2021-01-02 16:46 +0000
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-03 01:59 -0800
Re: A very brief history of mathematics Barb Ungaro <bah4@vhadtbs.nc> - 2021-01-03 13:39 +0000
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-03 10:08 -0600
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2021-01-03 15:19 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2021-01-04 01:37 +0100
Re: A very brief history of mathematics Dan Christensen <Dan_Christensen@sympatico.ca> - 2020-12-26 06:49 -0800
Re: A very brief history of mathematics Dan Christensen <Dan_Christensen@sympatico.ca> - 2020-12-26 11:33 -0800
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-27 11:22 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-27 14:08 -0600
Re: A very brief history of mathematics Dan Christensen <Dan_Christensen@sympatico.ca> - 2020-12-27 13:37 -0800
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2020-12-28 06:07 -0800
Re: A very brief history of mathematics FromTheRafters <erratic@nomail.afraid.org> - 2020-12-28 09:43 -0500
Re: A very brief history of mathematics Python <python@python.invalid> - 2020-12-28 15:50 +0100
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-28 16:06 -0600
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2020-12-29 03:52 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2020-12-29 15:27 -0600
Re: A very brief history of mathematics Brad Gassaway <bdswy@nnceunis.jp> - 2020-12-30 15:29 +0000
Re: A very brief history of mathematics Python <python@python.invalid> - 2020-12-30 02:13 +0100
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2020-12-30 03:07 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2020-12-30 15:27 +0100
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-01 08:37 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-02 09:11 -0600
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-03 01:48 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-03 08:54 -0600
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-03 01:44 -0800
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2021-01-01 09:39 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2021-01-01 18:51 +0100
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-02 03:11 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-02 09:14 -0600
Re: A very brief history of mathematics Mostowski Collapse <bursejan@gmail.com> - 2021-01-02 15:13 -0800
Re: A very brief history of mathematics Mostowski Collapse <bursejan@gmail.com> - 2021-01-02 15:20 -0800
Re: A very brief history of mathematics Mostowski Collapse <bursejan@gmail.com> - 2021-01-02 15:29 -0800
Re: A very brief history of mathematics Mostowski Collapse <bursejan@gmail.com> - 2021-01-02 15:31 -0800
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2021-01-03 15:17 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2021-01-04 01:36 +0100
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2021-01-04 13:06 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2021-01-04 22:44 +0100
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-05 07:21 -0800
Re: A very brief history of mathematics Yung Ju-Jing <yjj241@wiodkks.cn> - 2021-01-05 16:14 +0000
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-05 11:19 -0600
Re: A very brief history of mathematics Yung Ju-Jing <yjj241@wiodkks.cn> - 2021-01-05 17:52 +0000
Re: A very brief history of mathematics Yung Ju-Jing <yjj241@wiodkks.cn> - 2021-01-05 18:13 +0000
Re: A very brief history of mathematics Yung Ju-Jing <yjj241@wiodkks.cn> - 2021-01-05 18:16 +0000
Re: A very brief history of mathematics Yung Ju-Jing <yjj241@wiodkks.cn> - 2021-01-05 16:17 +0000
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2021-01-06 05:49 -0800
Re: A very brief history of mathematics FromTheRafters <erratic@nomail.afraid.org> - 2021-01-06 10:08 -0500
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2021-01-06 07:32 -0800
Re: A very brief history of mathematics Python <python@python.invalid> - 2021-01-06 19:51 +0100
Re: A very brief history of mathematics David Petry <davidlpetry@gmail.com> - 2021-01-08 10:14 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-08 14:18 -0600
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-05 11:12 -0600
Re: A very brief history of mathematics "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-06 22:18 -0800
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-07 02:49 -0800
Re: A very brief history of mathematics Mostowski Collapse <bursejan@gmail.com> - 2021-01-07 03:10 -0800
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-07 03:20 -0800
Re: A very brief history of mathematics Mostowski Collapse <bursejan@gmail.com> - 2021-01-07 04:30 -0800
Re: A very brief history of mathematics "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-07 05:21 -0800
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-07 05:34 -0800
Re: A very brief history of mathematics "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-07 22:08 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-07 08:10 -0600
Re: A very brief history of mathematics "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-07 05:20 -0800
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-07 06:57 -0800
Re: A very brief history of mathematics Mostowski Collapse <bursejan@gmail.com> - 2021-01-07 07:44 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-07 10:16 -0600
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-07 08:42 -0800
Re: A very brief history of mathematics FromTheRafters <erratic@nomail.afraid.org> - 2021-01-07 11:49 -0500
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-07 22:19 -0600
Re: A very brief history of mathematics "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-07 22:09 -0800
Re: A very brief history of mathematics WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-08 07:11 -0800
Re: A very brief history of mathematics Sergio <invalid@invalid.com> - 2021-01-08 14:22 -0600
Page 3 of 6 — ← Prev page 1 2 [3] 4 5 6 Next page →
| From | David Petry <davidlpetry@gmail.com> |
|---|---|
| Date | 2020-12-27 11:22 -0800 |
| Message-ID | <593735c0-75fc-48e8-973d-bde6b0676edbn@googlegroups.com> |
| In reply to | #508060 |
On Saturday, December 26, 2020 at 11:33:30 AM UTC-8, Dan Christensen wrote: > On Saturday, December 26, 2020 at 9:49:40 AM UTC-5, Dan Christensen wrote: > > On Friday, December 25, 2020 at 4:01:39 PM UTC-5, david...@gmail.com wrote: > > > On Friday, December 25, 2020 at 10:17:47 AM UTC-8, FredJeffries wrote: > > > > On Thursday, December 24, 2020 at 9:56:45 AM UTC-8, david...@gmail.com wrote: > > > > > > > > > > About a year ago, I started a thread "EXAMPLES of falsifiability in mathematics". Please look that up and read it. > > > > https://groups.google.com/g/sci.math/c/i4fPZSjcAtM/m/eoRX07okAgAJ > > > > > > > > In that thread you proposed only one example of your notion of 'falsifiability in mathematics'. That that example actually demonstrated falsifiability was falsified. See message posted in that thread Dec 16, 2019, 4:54:34 AM > > > Usually when I define "falsifiability" I include the word "feasible". A falsifiable statement must predict the outcome of feasible experiments. I guess I left it out just to keep things simple. > > > > > > I use "falsifiability" in a way as similar as possible to the way scientists use it. For example, if the only prediction a statement in physics were to make requires a particle accelerator the size of the whole universe to perform the experiment, then the statement would not be falsifiable. > > > > > Hint: All it would take to falsify a mathematical statement(s) is a pencil and paper. You could make use of: > > > > [P => Q & ~Q] => ~P > > > > See Russell's Paradox for example. > You want to "falsify" the ZFC axioms of set theory; Russell falsified Frege's axioms of set theory with his famous paradox. Have at it, Dave! I find it disturbing to see just how far you are from understanding the things I write. > > Dan > > > > Download my DC Proof 2.0 software at http://www.dcproof.com > > Visit my Math Blog at http://www.dcproof.wordpress.com
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2020-12-27 14:08 -0600 |
| Message-ID | <rsapjb$1mpq$2@gioia.aioe.org> |
| In reply to | #508139 |
On 12/27/2020 1:22 PM, David Petry wrote: > On Saturday, December 26, 2020 at 11:33:30 AM UTC-8, Dan Christensen wrote: >> On Saturday, December 26, 2020 at 9:49:40 AM UTC-5, Dan Christensen wrote: >>> On Friday, December 25, 2020 at 4:01:39 PM UTC-5, david...@gmail.com wrote: >>>> On Friday, December 25, 2020 at 10:17:47 AM UTC-8, FredJeffries wrote: >>>>> On Thursday, December 24, 2020 at 9:56:45 AM UTC-8, david...@gmail.com wrote: >>>>>> >>>>>> About a year ago, I started a thread "EXAMPLES of falsifiability in mathematics". Please look that up and read it. >>>>> https://groups.google.com/g/sci.math/c/i4fPZSjcAtM/m/eoRX07okAgAJ >>>>> >>>>> In that thread you proposed only one example of your notion of 'falsifiability in mathematics'. That that example actually demonstrated falsifiability was falsified. See message posted in that thread Dec 16, 2019, 4:54:34 AM >>>> Usually when I define "falsifiability" I include the word "feasible". A falsifiable statement must predict the outcome of feasible experiments. I guess I left it out just to keep things simple. >>>> >>>> I use "falsifiability" in a way as similar as possible to the way scientists use it. For example, if the only prediction a statement in physics were to make requires a particle accelerator the size of the whole universe to perform the experiment, then the statement would not be falsifiable. >>>> >>> Hint: All it would take to falsify a mathematical statement(s) is a pencil and paper. You could make use of: >>> >>> [P => Q & ~Q] => ~P >>> >>> See Russell's Paradox for example. >> You want to "falsify" the ZFC axioms of set theory; Russell falsified Frege's axioms of set theory with his famous paradox. Have at it, Dave! > > > I find it disturbing to see just how far you are from understanding the things I write. ....and you are the guy promoting "feasible falsifiability", when falsifiability is defeasibility. perhaps you should learn the subject matter before you "write" about it. > > >>> Dan >>> >>> Download my DC Proof 2.0 software at http://www.dcproof.com >>> Visit my Math Blog at http://www.dcproof.wordpress.com
[toc] | [prev] | [next] | [standalone]
| From | Dan Christensen <Dan_Christensen@sympatico.ca> |
|---|---|
| Date | 2020-12-27 13:37 -0800 |
| Message-ID | <6fa0a268-92ee-4fad-9bd9-2355710b895cn@googlegroups.com> |
| In reply to | #508139 |
On Sunday, December 27, 2020 at 2:22:10 PM UTC-5, david...@gmail.com wrote: > On Saturday, December 26, 2020 at 11:33:30 AM UTC-8, Dan Christensen wrote: > > On Saturday, December 26, 2020 at 9:49:40 AM UTC-5, Dan Christensen wrote: > > > On Friday, December 25, 2020 at 4:01:39 PM UTC-5, david...@gmail.com wrote: > > > > On Friday, December 25, 2020 at 10:17:47 AM UTC-8, FredJeffries wrote: > > > > > On Thursday, December 24, 2020 at 9:56:45 AM UTC-8, david...@gmail.com wrote: > > > > > > > > > > > > About a year ago, I started a thread "EXAMPLES of falsifiability in mathematics". Please look that up and read it. > > > > > https://groups.google.com/g/sci.math/c/i4fPZSjcAtM/m/eoRX07okAgAJ > > > > > > > > > > In that thread you proposed only one example of your notion of 'falsifiability in mathematics'. That that example actually demonstrated falsifiability was falsified. See message posted in that thread Dec 16, 2019, 4:54:34 AM > > > > Usually when I define "falsifiability" I include the word "feasible". A falsifiable statement must predict the outcome of feasible experiments. I guess I left it out just to keep things simple. > > > > > > > > I use "falsifiability" in a way as similar as possible to the way scientists use it. For example, if the only prediction a statement in physics were to make requires a particle accelerator the size of the whole universe to perform the experiment, then the statement would not be falsifiable. > > > > > > > Hint: All it would take to falsify a mathematical statement(s) is a pencil and paper. You could make use of: > > > > > > [P => Q & ~Q] => ~P > > > > > > See Russell's Paradox for example. > > You want to "falsify" the ZFC axioms of set theory; Russell falsified Frege's axioms of set theory with his famous paradox. Have at it, Dave! > I find it disturbing to see just how far you are from understanding the things I write. I get it. You are wedded to some needlessly complicated philosophy and are too stubborn to admit just how simple the answer is. It is conceivable that a mathematical theory can be falsified. History gives us an example of how it is done in Russell's Paradox. Deal with it. Dan Download my DC Proof 2.0 software at http://www.dcproof.com Visit my Math Blog at http://www.dcproof.wordpress.com
[toc] | [prev] | [next] | [standalone]
| From | David Petry <davidlpetry@gmail.com> |
|---|---|
| Date | 2020-12-28 06:07 -0800 |
| Message-ID | <33eb99c8-a612-4b95-b58b-63678e9787dfn@googlegroups.com> |
| In reply to | #508153 |
On Sunday, December 27, 2020 at 1:37:26 PM UTC-8, Dan Christensen wrote: > I get it. You are wedded to some needlessly complicated philosophy and are too stubborn to admit just how simple the answer is. It is conceivable that a mathematical theory can be falsified. History gives us an example of how it is done in Russell's Paradox. Deal with it. > Dan No, actually, you don't get it at all. Not even close.
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2020-12-28 09:43 -0500 |
| Message-ID | <rscqve$1ls0$1@gioia.aioe.org> |
| In reply to | #508181 |
David Petry brought next idea : > On Sunday, December 27, 2020 at 1:37:26 PM UTC-8, Dan Christensen wrote: > >> I get it. You are wedded to some needlessly complicated philosophy and are >> too stubborn to admit just how simple the answer is. It is conceivable that >> a mathematical theory can be falsified. History gives us an example of how >> it is done in Russell's Paradox. Deal with it. Dan > > > No, actually, you don't get it at all. Not even close. In your view, does the lack of zero or infinite resistors mean that Ohm's Law is not falsifiable? If so, would such an obviously useful ideal model be considered valid in AI? Same idea for D=RT? E=MC^2? To me, application takes place within the area whose borders are such ideals and it tracks well with empirical evidences. We need not actually "touch" these borders but asymtotically approach them. Shouldn't AI be able to handle the same ideas which human intelligence does?
[toc] | [prev] | [next] | [standalone]
| From | Python <python@python.invalid> |
|---|---|
| Date | 2020-12-28 15:50 +0100 |
| Message-ID | <5fe9f0c1$0$24259$426a74cc@news.free.fr> |
| In reply to | #508184 |
FromTheRafters wrote: > David Petry brought next idea : >> On Sunday, December 27, 2020 at 1:37:26 PM UTC-8, Dan Christensen wrote: >> >>> I get it. You are wedded to some needlessly complicated philosophy >>> and are too stubborn to admit just how simple the answer is. It is >>> conceivable that a mathematical theory can be falsified. History >>> gives us an example of how it is done in Russell's Paradox. Deal with >>> it. Dan >> >> >> No, actually, you don't get it at all. Not even close. > > In your view, does the lack of zero or infinite resistors mean that > Ohm's Law is not falsifiable? If so, would such an obviously useful > ideal model be considered valid in AI? Same idea for D=RT? E=MC^2? > > To me, application takes place within the area whose borders are such > ideals and it tracks well with empirical evidences. We need not actually > "touch" these borders but asymtotically approach them. > > Shouldn't AI be able to handle the same ideas which human intelligence > does? Moreover it definitely makes more sense to qualify theorem provers (Coq, HOL, ...) as "AI" than to disguise good old classifying algorithms based on statistics as it is done so often... ... and theorem provers have absolutely no problems in dealing with infinities, diagonal arguments, transfinite cardinals and ordinals, etc. While natural stupidity as implemented in David Petry's or Wolfgang Mueckenheim's brains cannot handle them.
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2020-12-28 16:06 -0600 |
| Message-ID | <rsdktc$hi4$1@gioia.aioe.org> |
| In reply to | #508186 |
On 12/28/2020 8:50 AM, Python wrote: > FromTheRafters wrote: >> David Petry brought next idea : >>> On Sunday, December 27, 2020 at 1:37:26 PM UTC-8, Dan Christensen wrote: >>> >>>> I get it. You are wedded to some needlessly complicated philosophy >>>> and are too stubborn to admit just how simple the answer is. It is >>>> conceivable that a mathematical theory can be falsified. History >>>> gives us an example of how it is done in Russell's Paradox. Deal >>>> with it. Dan >>> >>> >>> No, actually, you don't get it at all. Not even close. >> >> In your view, does the lack of zero or infinite resistors mean that >> Ohm's Law is not falsifiable? If so, would such an obviously useful >> ideal model be considered valid in AI? Same idea for D=RT? E=MC^2? >> >> To me, application takes place within the area whose borders are such >> ideals and it tracks well with empirical evidences. We need not >> actually "touch" these borders but asymtotically approach them. we would design (rf microwave etc) using math every step to guide us, and we correct for real world, math could not handle, and there are many borders that are edges like that, design trade offs. Most designs I got into were multi-dimensional problems (degrees of freedom, or number of input vectors) that can be optimized to a degree, but not solved, and there can be many optimal areas, in different ways... >> >> Shouldn't AI be able to handle the same ideas which human intelligence >> does? > > Moreover it definitely makes more sense to qualify theorem provers > (Coq, HOL, ...) as "AI" than to disguise good old classifying > algorithms based on statistics as it is done so often... > > ... and theorem provers have absolutely no problems in dealing with > infinities, diagonal arguments, transfinite cardinals and ordinals, > etc. > > While natural stupidity as implemented in David Petry's or Wolfgang > Mueckenheim's brains cannot handle them. > > good insights, AI has been around a *long* time, like LISP, Prolog, and neural networks have advanced remarkably. I was using free versions of those 20 years ago. now you can put together a license plate reader out of a raspberry pi, ($50) camera, and opensource code, then train it... (replaces $50k cop version)
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2020-12-29 03:52 -0800 |
| Message-ID | <f64318e5-6ebf-4fa2-a538-5c717c480401n@googlegroups.com> |
| In reply to | #508186 |
Python schrieb am Montag, 28. Dezember 2020 um 15:50:50 UTC+1: > ... and theorem provers have absolutely no problems in dealing with > infinities, diagonal arguments, transfinite cardinals and ordinals, > etc. They are made as stupid by their programmers as these programmers are themselves. Note than an infinite digit sequence has no end and therefore does not finally define a real number. Only fools of matheology can miss this simple fact. And they program their computers such that these also miss it. > While natural stupidity as implemented in David Petry's or Wolfgang > Mueckenheim's brains cannot handle them. We can handle the fact that every definition has an end. Otherwise it is not a definition. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2020-12-29 15:27 -0600 |
| Message-ID | <rsg70e$drq$1@gioia.aioe.org> |
| In reply to | #508223 |
On 12/29/2020 5:52 AM, WM wrote: > Python schrieb am Montag, 28. Dezember 2020 um 15:50:50 UTC+1: > >> ... and theorem provers have absolutely no problems in dealing with >> infinities, diagonal arguments, transfinite cardinals and ordinals, >> etc. > > They are made as stupid by their programmers as these programmers are themselves. > Note than an infinite digit sequence has no end and therefore does not finally define a real number. > Only fools of matheology can miss this simple fact. And they program their computers such that these also miss it. wrong again, it is not missed at all, it is even calculated it is called "error bounds", "acceptable error", "error ball", "tolerance", precision, ... k +_ 0.000001 includes all numbers k and near k, withing 0.0000001 high and low, yes an infinity of numbers next to k. you are lost in between your non-representable numbers, but remember, if you cannot tell the difference between numbers, they are the same. you should look up the Allan Varance while your at it fools? hahaha..... > >> While natural stupidity as implemented in David Petry's or Wolfgang >> Mueckenheim's brains cannot handle them. > > We can handle the fact that every definition has an end. Otherwise it is not a definition. > > Regards, WM >
[toc] | [prev] | [next] | [standalone]
| From | Brad Gassaway <bdswy@nnceunis.jp> |
|---|---|
| Date | 2020-12-30 15:29 +0000 |
| Message-ID | <rsi6ck$1qqj$3@gioia.aioe.org> |
| In reply to | #508261 |
Sergio wrote: > wrong again, it is not missed at all, it is even calculated > it is called "error bounds", "acceptable error", "error ball", > "tolerance", precision, ... > k +_ 0.000001 includes all numbers k and near k, withing 0.0000001 high > and low, yes an infinity of numbers next to k. Ohh please, don't be thinking they are stupid, just because YOU are stupid. Before the fake "corona" there was movements and pushbacks around the world, hong-kong, yellow vests europe, etc. There's not even possible having it now. The same did with the unions and the socialist organisation, made them kings on bonuses. So people can't discuss and organise defending their human interests. Meanwhile the capitalists DO organize, running simulations, drills, bilderbergers, meetings, models, presentations openly on universities etc etc. They have you right now by your balls, they made you think the unbelievable, that you like capitalism, that the big evil capitalists are "communists" and now people are to be erased for the lack of brain and knowledge.
[toc] | [prev] | [next] | [standalone]
| From | Python <python@python.invalid> |
|---|---|
| Date | 2020-12-30 02:13 +0100 |
| Message-ID | <5febd431$0$6446$426a74cc@news.free.fr> |
| In reply to | #508223 |
Crank Wolfgang Mueckenheim, aka WM wrote: > Python schrieb am Montag, 28. Dezember 2020 um 15:50:50 UTC+1: > >> ... and theorem provers have absolutely no problems in dealing with >> infinities, diagonal arguments, transfinite cardinals and ordinals, >> etc. > > They are made as stupid by their programmers as these programmers are themselves. > Note than an infinite digit sequence has no end and therefore does not finally define a real number. > Only fools of matheology can miss this simple fact. And they program their computers such that these also miss it. Given all the blunders you've made when it comes to nesting structures likes sets, or mixing up sets of items of a sequences with the set which actually is the sequence, you'd have been as bad as a programmer than you are as a "mathematician", crank Wolfgang Mueckenheim, from Hochschule Augsburg. These systems are implementing the legacy of mathematicians like Brouwer, i.e. intuitionistic logic something you couldn't even understand in your dreams while students can. While being misquoted in your infamous "book", crank Wolfgang Mueckenheim, from Hochschule Augsburg is a disgrace for Brouwer's memory. >> While natural stupidity as implemented in David Petry's or Wolfgang >> Mueckenheim's brains cannot handle them. > > We can handle the fact that every definition has an end. Otherwise it is not a definition. All definitions used in theorem provers are finite. Nevertheless they have no problem in proving theorems about transfinite sets, ordinals, and can even certify Cantor's proof of the innumerability of real numbers.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2020-12-30 03:07 -0800 |
| Message-ID | <faef05cc-3a22-4d3d-8821-ae11e69e1ad8n@googlegroups.com> |
| In reply to | #508274 |
Python schrieb am Mittwoch, 30. Dezember 2020 um 02:13:32 UTC+1: > > We can handle the fact that every definition has an end. Otherwise it is not a definition. > All definitions used in theorem provers are finite. Nevertheless they > have no problem in proving theorems about transfinite sets, ordinals, > and can even certify Cantor's proof of the innumerability of real > numbers. This shows how stupid they are, these computers and their programmers and those who believe this nonsense. No real number can be defined by an infinite digit sequence without a generating formula. Therefore not uncountably many real numbers can exist. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Python <python@python.invalid> |
|---|---|
| Date | 2020-12-30 15:27 +0100 |
| Message-ID | <5fec8e62$0$4037$426a74cc@news.free.fr> |
| In reply to | #508287 |
Crank Wolfgang Mueckenheim, aka WM wrote: > Python schrieb am Mittwoch, 30. Dezember 2020 um 02:13:32 UTC+1: > > >>> We can handle the fact that every definition has an end. Otherwise it is not a definition. >> All definitions used in theorem provers are finite. Nevertheless they >> have no problem in proving theorems about transfinite sets, ordinals, >> and can even certify Cantor's proof of the innumerability of real >> numbers. > > This shows how stupid they are, these computers and their programmers and those who believe this nonsense. Yeah, sure. An idiot like you know better. Remind this next time you'll take a flight. Criticial software in Airbus planes is validated by this same very theorem prover.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-01-01 08:37 -0800 |
| Message-ID | <687423df-3fa3-46a0-bb1d-a358bf44b1a2n@googlegroups.com> |
| In reply to | #508293 |
Python schrieb am Mittwoch, 30. Dezember 2020 um 15:27:58 UTC+1: > Remind this next time you'll take a flight. Criticial software in Airbus > planes is validated by this same very theorem prover. No real number can be defined by an infinite digit sequence without a generating formula. Therefore uncountably many real numbers cannot exist. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2021-01-02 09:11 -0600 |
| Message-ID | <rsq2fm$153a$1@gioia.aioe.org> |
| In reply to | #508430 |
On 1/1/2021 10:37 AM, WM wrote: > Python schrieb am Mittwoch, 30. Dezember 2020 um 15:27:58 UTC+1: > >> Remind this next time you'll take a flight. Criticial software in Airbus >> planes is validated by this same very theorem prover. > > No real number can be defined by an infinite digit sequence without a generating formula. Therefore uncountably many real numbers cannot exist. wrong. 1.000... you have confused counting rocks, with number representation. > > Regards, WM >
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-01-03 01:48 -0800 |
| Message-ID | <b4861c3f-c9fa-4ff6-8468-e333d07968dbn@googlegroups.com> |
| In reply to | #508545 |
Sergio schrieb am Samstag, 2. Januar 2021 um 16:12:01 UTC+1: > On 1/1/2021 10:37 AM, WM wrote: > > Python schrieb am Mittwoch, 30. Dezember 2020 um 15:27:58 UTC+1: > > > >> Remind this next time you'll take a flight. Criticial software in Airbus > >> planes is validated by this same very theorem prover. Wow! Is Europe so far ahead of the USA? NASA uses 3,141592653589793 instead of π for their space missions to far planets, and Airbus needs provers of transfinite set theory for flying from Paris to Berlin. > > > > No real number can be defined by an infinite digit sequence without a generating formula. Therefore uncountably many real numbers cannot exist. > wrong. 1.000... That is not an infinite digit sequence but a finite formula comprising 8 symbols generating it. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2021-01-03 08:54 -0600 |
| Message-ID | <rsslr2$1utq$1@gioia.aioe.org> |
| In reply to | #508632 |
On 1/3/2021 3:48 AM, WM wrote:
> Sergio schrieb am Samstag, 2. Januar 2021 um 16:12:01 UTC+1:
>> On 1/1/2021 10:37 AM, WM wrote:
>>> Python schrieb am Mittwoch, 30. Dezember 2020 um 15:27:58 UTC+1:
>>>
>>>> Remind this next time you'll take a flight. Criticial software in Airbus
>>>> planes is validated by this same very theorem prover.
>
> Wow! Is Europe so far ahead of the USA?
>
> NASA uses 3,141592653589793 instead of π for their space missions to far planets, and Airbus needs provers of transfinite set theory for flying from Paris to Berlin.
>>>
>>> No real number can be defined by an infinite digit sequence without a generating formula. Therefore uncountably many real numbers cannot exist.
>> wrong. 1.000...
>
> That is not an infinite digit sequence but a finite formula comprising 8 symbols generating it.
wrong-o,
it is an infinite sequence,
it is not a 'formula',
it does not 'generate' anything,
and 4 of what you call 'symbols' are in fact 'natural numbers'.
what is a 'symbol'? decimal, Hex, Binary, Rocks, ascii, bodot, k, n,
it is noticeable you fail to understand common math nomenclature.
using your thinking, 'WM' cannot represent 'Wolfgang Mueckenheim'
Does such a myopic view of math numbers lead to new fields of
math research ?
>
> Regards, WM
>
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-01-03 01:44 -0800 |
| Message-ID | <014da3ed-36ef-4193-a87e-7bd92fa442fen@googlegroups.com> |
| In reply to | #508293 |
Python schrieb am Mittwoch, 30. Dezember 2020 um 15:27:58 UTC+1: > WM wrote: > > Python schrieb am Mittwoch, 30. Dezember 2020 um 02:13:32 UTC+1: > > > > > >>> We can handle the fact that every definition has an end. Otherwise it is not a definition. > >> All definitions used in theorem provers are finite. Nevertheless they > >> have no problem in proving theorems about transfinite sets, ordinals, > >> and can even certify Cantor's proof of the innumerability of real > >> numbers. > > > > This shows how stupid they are, these computers and their programmers and those who believe this nonsense. > Yeah, sure. An idiot like you know better. > Remind this next time you'll take a flight. Criticial software in Airbus > planes is validated by this same very theorem prover. Wow! Is Europe so far ahead of the USA? NASA uses 3,141592653589793 instead of π for their space missions to far planets, and Airbus needs provers of transfinite set theory for flying from Paris to Berlin. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | David Petry <davidlpetry@gmail.com> |
|---|---|
| Date | 2021-01-01 09:39 -0800 |
| Message-ID | <e90b4389-3b04-4980-877c-0c388752d800n@googlegroups.com> |
| In reply to | #508186 |
On Monday, December 28, 2020 at 6:50:50 AM UTC-8, Python wrote: > ... and theorem provers have absolutely no problems in dealing with > infinities, diagonal arguments, transfinite cardinals and ordinals, > etc. And computers play a mean game of chess. Theorem provers don't deal with the meaning of formal systems, just the formal structure. > While natural stupidity as implemented in David Petry's or Wolfgang > Mueckenheim's brains cannot handle them. You are just so wrong.
[toc] | [prev] | [next] | [standalone]
| From | Python <python@python.invalid> |
|---|---|
| Date | 2021-01-01 18:51 +0100 |
| Message-ID | <5fef611e$0$4028$426a74cc@news.free.fr> |
| In reply to | #508441 |
David Petry wrote: > On Monday, December 28, 2020 at 6:50:50 AM UTC-8, Python wrote: > >> ... and theorem provers have absolutely no problems in dealing with >> infinities, diagonal arguments, transfinite cardinals and ordinals, >> etc. > > And computers play a mean game of chess. > > Theorem provers don't deal with the meaning of formal systems, > just the formal structure. Which are the same thing. You should have a look to Dr. Krivine and his lab in Paris, they published very interesting constructive results. Including the surprising constructibility of Axiom of Choice. >> While natural stupidity as implemented in David Petry's or Wolfgang >> Mueckenheim's brains cannot handle them. > > You are just so wrong. Unfortunately for you, you both have proven this quite extensively here and there.
[toc] | [prev] | [next] | [standalone]
Page 3 of 6 — ← Prev page 1 2 [3] 4 5 6 Next page →
Back to top | Article view | sci.math
csiph-web