1. Forum
  2. USENET
  3. comp.theory
LRM moving from FOM to TCS [Lean Prover] (Was: Is Causal AI simply ReLU (Geoffrey E. Hinton 2010)))

By Mild Shock on Fri Feb 27 10:21:16 2026

Latest reply by wij on Tue Mar 3 08:39:18 2026
Re: on ignoring the undecidable --- Liar Paradox disguised

By olcott on Sun Feb 8 19:06:11 2026

Latest reply by dart200 on Tue Mar 3 01:44:42 2026
Re: on ignoring the undecidable

By Richard Damon on Sat Feb 7 09:34:38 2026

Latest reply by dart200 on Tue Mar 3 01:18:09 2026
Relearning the Calculus

By Daniel on Mon Feb 23 09:49:29 2026

Latest reply by Lawrence =?iso-8859-13?q?D=FFOliveiro?= on Mon Mar 2 00:42:20 2026
From specifications to code we go code generation...

By Julio Di Egidio on Thu Feb 26 20:40:39 2026

Latest reply by Julio Di Egidio on Thu Feb 26 20:40:39 2026
AI is taking our jobs .. not

By Mr Flibble on Sat Feb 21 21:47:38 2026

Latest reply by Mr Flibble on Sat Feb 21 21:47:38 2026
Making all knowledge expressed in language computable

By olcott on Tue Feb 10 07:37:02 2026

Latest reply by Mikko on Fri Feb 20 11:46:27 2026
=?UTF-8?Q?Re=3A_Boiling_G=C3=B6del=27s_1931_Incompleteness_down_to_?= =?UTF-8?Q?its_essence?=

By Richard Damon on Fri Feb 13 11:01:15 2026

Latest reply by Richard Damon on Fri Feb 13 11:01:15 2026
Re: Making the body of knowledge computable

By =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?= on Wed Feb 11 13:43:45 2026

Latest reply by olcott on Thu Feb 12 14:26:21 2026
Another undecidable problem?

By wij on Tue Feb 10 19:20:10 2026

Latest reply by wij on Tue Feb 10 19:20:10 2026
Changing the foundational basis to Proof Theoretic Semantics Tarski Undefinability is overcome

By olcott on Thu Feb 5 10:55:56 2026

Latest reply by Richard Damon on Mon Feb 9 22:47:26 2026
Re: on ignoring the undecidable --- proof theoretic semantics

By olcott on Mon Feb 9 19:37:21 2026

Latest reply by olcott on Mon Feb 9 19:37:21 2026
Re: on ignoring the undecidable --- PLO

By olcott on Mon Feb 9 11:42:05 2026

Latest reply by olcott on Mon Feb 9 11:42:05 2026
When halt provers are allowed to reject bad inputs the remaining domain is decidable

By olcott on Wed Feb 4 10:47:50 2026

Latest reply by Mikko on Sun Feb 8 11:06:04 2026
AI is great...

By Mr Flibble on Fri Feb 6 23:04:18 2026

Latest reply by Mr Flibble on Fri Feb 6 23:04:18 2026
Re: is the ct-thesis cooked?

By dart200 on Sun Jan 25 20:01:15 2026

Latest reply by Richard Damon on Fri Feb 6 19:26:15 2026
Re: Collatz Problem proved.

By wij on Fri Feb 6 14:19:58 2026

Latest reply by wij on Fri Feb 6 14:19:58 2026
=?UTF-8?B?UmU6IFBBIHN5c3RlbSBjYW5ub3QgcHJvdmUgIuKInuKIiOKElSIgUExP?=

By olcott on Thu Jan 29 12:06:20 2026

Latest reply by Mikko on Mon Feb 2 09:32:24 2026
Re: The Halting Problem asks for too much

By olcott on Sun Jan 25 20:31:23 2026

Latest reply by Mikko on Sun Feb 1 12:28:05 2026
=?UTF-8?Q?Re=3A_G=C3=B6del=27s_G_has_never_actually_been_true_in_ar?= =?UTF-8?Q?ithmetic?=

By olcott on Wed Jan 28 12:08:43 2026

Latest reply by Richard Damon on Sun Feb 1 07:33:42 2026
PA system cannot prove =?UTF-8?Q?=22=E2=88=9E=E2=88=88=E2=84=95=22?=

By wij on Tue Jan 27 01:48:04 2026

Latest reply by Richard Damon on Sun Feb 1 07:33:25 2026
Re: a subset of turing machines can still be turing complete

By Tristan Wibberley on Wed Jan 28 23:22:54 2026

Latest reply by dart200 on Thu Jan 29 21:18:23 2026
Re: The primary first principle of all Turing Machine based computation

By Richard Heathfield on Mon Jan 26 02:57:52 2026

Latest reply by Richard Heathfield on Mon Jan 26 02:57:52 2026