Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.software-eng

comp.software-eng

3597 articles (numbers 24 – 4003) — threaded view

| Advanced

Subject Author Date [asc]
yes/no questions lacking a correct yes/no answer are incorrect questions olcott <polcott333@gmail.com> 2026-01-07 05:50 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-07 05:54 -0600
Re: is the ct-thesis cooked? Mikko <mikko.levanto@iki.fi> 2026-01-07 14:05 +0200
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Mikko <mikko.levanto@iki.fi> 2026-01-07 14:10 +0200
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <polcott333@gmail.com> 2026-01-07 07:06 -0600
Exactly what are deciders in the theory of computation? olcott <polcott333@gmail.com> 2026-01-07 15:29 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Mikko <mikko.levanto@iki.fi> 2026-01-08 12:21 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> 2026-01-08 12:22 +0200
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <polcott333@gmail.com> 2026-01-08 08:18 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-08 08:22 -0600
Ada-Europe Conference - 13 Feb Journal Track Extended Deadline dirk@orka.cs.kuleuven.be. (Dirk Craeynest) 2026-01-08 21:23 +0000
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> 2026-01-09 11:59 +0200
Haskell Curry Foundations of Mathematical Logic sense of true in the system olcott <polcott333@gmail.com> 2026-01-09 09:47 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-09 09:52 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> 2026-01-10 10:23 +0200
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Mikko <mikko.levanto@iki.fi> 2026-01-10 11:25 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-10 09:47 -0600
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 18:19 -0500
Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 17:19 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-10 18:13 -0600
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 19:35 -0500
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 19:35 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-10 18:52 -0600
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 19:03 -0600
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 19:05 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 21:03 -0500
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 21:03 -0500
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 21:03 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 20:09 -0600
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 20:20 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-10 20:22 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 21:33 -0500
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 21:33 -0500
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 21:34 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 21:16 -0600
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 21:18 -0600
Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 21:24 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 22:28 -0500
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 22:30 -0500
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-10 22:32 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-10 21:34 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> 2026-01-11 12:13 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> 2026-01-11 12:22 +0200
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> 2026-01-11 06:31 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> 2026-01-11 08:03 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-11 08:18 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> 2026-01-11 08:23 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <polcott333@gmail.com> 2026-01-11 08:32 -0600
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> 2026-01-11 16:16 +0000
Re: Boiling Gödel's 1931 Incompleteness proof down to its barest essence olcott <NoOne@NoWhere.com> 2026-01-11 21:00 -0600

« Previous 1 ... 3 4 5 6 7 ... 72 Next »


csiph-web