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


Groups > comp.theory > #11992

Re: Proof of recursion theorem

From Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups comp.theory, sci.logic
Subject Re: Proof of recursion theorem
Date 2017-04-10 14:41 +0100
Organization A noiseless patient Spider
Message-ID <87mvbos7lz.fsf@bsb.me.uk> (permalink)
References <ocelih$ulr$1@dont-email.me>

Cross-posted to 2 groups.

Show all headers | View raw


Newberry <newberryxy@gmail.com> writes:

> Let T be a Turing machine that computes a a function t: N → N. There
> is a Turing machine R that computes a number r, such that r = T(<R>).

Can you give a citation for this theorem?  The document you cite below
has quite a different theorem.

<snip>
-- 
Ben.

Back to comp.theory | Previous | Next — Previous in thread | Find similar | Unroll thread


Thread

Proof of recursion theorem Newberry <newberryxy@gmail.com> - 2017-04-09 21:04 -0400
  Re: Proof of recursion theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-10 14:41 +0100

csiph-web