| Deutsch English Français Italiano |
|
<vukv7n$igon$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.nobody.at!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Mikko <mikko.levanto@iki.fi> Newsgroups: sci.logic Subject: Re: Turing Machine computable functions apply finite string transformations to inputs Date: Sun, 27 Apr 2025 13:00:23 +0300 Organization: - Lines: 50 Message-ID: <vukv7n$igon$1@dont-email.me> References: <vu6lnf$39fls$2@dont-email.me> <vua9oi$2lub6$1@dont-email.me> <vudkah$1ona3$1@dont-email.me> <vufi61$3k099$1@dont-email.me> <vugddv$b21g$2@dont-email.me> <vuivtb$2lf64$3@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sun, 27 Apr 2025 12:00:23 +0200 (CEST) Injection-Info: dont-email.me; posting-host="e20b51155d493a56da5db83ddb0aac41"; logging-data="606999"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+wV2pcZQ895GMJ70NYmfZt" User-Agent: Unison/2.2 Cancel-Lock: sha1:wgLAjKQq7mCYDKgrNyPO2JrUajI= Bytes: 2820 On 2025-04-26 15:59:39 +0000, olcott said: > On 4/26/2025 3:19 AM, Mikko wrote: >> On 2025-04-25 16:31:58 +0000, olcott said: >> >>> On 4/25/2025 3:46 AM, Mikko wrote: >>>> On 2025-04-24 15:11:13 +0000, olcott said: >>>> >>>>> On 4/23/2025 3:52 AM, Mikko wrote: >>>>>> On 2025-04-21 23:52:15 +0000, olcott said: >>>>>> >>>>>>> Computer Science Professor Eric Hehner PhD >>>>>>> and I all seem to agree that the same view >>>>>>> that Flibble has is the correct view. >>>>>> >>>>>> Others can see that their justification is defective and contradicted >>>>>> by a good proof. >>>>>> >>>>>> Some people claim that the unsolvability of the halting problem is >>>>>> unproven but nobody has solved the problem. >>>>> >>>>> For the last 22 years I have only been refuting the >>>>> conventional Halting Problem proof. >>>> >>>> Trying to refute. You have not shown any defect in that proof of the >>>> theorem. There are other proofs that you don't even try to refute. >>> >>> Not at all. You have simply not been paying enough attention. >>> >>> Once we understand that Turing computable functions are only >>> allowed >> >> Turing allowed Turing machines to do whatever they can do. > > Strawman deception error of changing the subject away > from computable functions. You are lying again. Turing machines are mientioned on the subject line so they are on topic. > Turing Machine Computable Functions are not allowed > to output anything besides the result of applying > finite string transformations to their input. Turing machine Computable Functions are allowed to do anything. If you don't allow something someone whose opinion matters does. -- Mikko