From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,29fe9a340e0d180d
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Depending on passing mechanism
Date: 1997/10/14
Message-ID: <dewar.876842784@merv>#1/1
X-Deja-AN: 280420973
References: <x2hgal3jxa.fsf@moon.inf.fu-berlin.de>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 876842834 21119 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-10-14T00:00:00+00:00
List-Id: <comp.lang.ada>


<<  * the proof that it's equivalent to the halting problem.  (I could
    do it myself, but I'd like to reference it in a paper.)
>>

I doubt there is a paper, since it is trivially obvious that this is the
case, since it depends on being able to compute possible paths at run
time, which is obviously equivalent to the halting problem.