Entry Zhong:1998:RES from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Zhong:1998:RES,
author = "Ning Zhong",
title = "Recursively enumerable subsets of {$R^q$} in two
computing models: {Blum-Shub-Smale} machine and
{Turing} machine",
journal = j-THEOR-COMP-SCI,
volume = "197",
number = "1--2",
pages = "79--94",
day = "15",
month = may,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=197&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/197/1-2/2544.pdf",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
conftitle = "Linear Logic '96 (papers in summary form only
received)",
corpsource = "Dept. of Math., Connecticut Univ., Storrs, CT, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Blum-Shub-Smale machine; computable hyperbolic
polynomial; computing models; decidability; Julia set;
recursively enumerable subsets; Turing machine; Turing
machines",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- computable,
139(1)243,
143(1)113,
145(1)241,
161(1)235,
162(1)45,
162(1)117,
169(1)67,
172(1)233,
175(1)183,
188(1)175,
192(2)315,
194(1)247-1,
210(1)3,
219(1)95,
219(1)111,
219(1)169,
219(1)319,
221(1)157,
224(1)13
- computing,
137(1)129,
138(1)211,
139(1)69,
141(1)1,
141(1)175,
147(1)181,
149(1)101,
155(1)157,
156(1)99,
156(1)217,
157(1)115,
161(1)69,
163(1)269,
164(1)107,
164(1)299,
168(2)321,
169(1)67,
174(1)123,
180(1)115,
180(1)287,
181(1)159,
181(1)181,
181(1)195,
182(1)159,
185(2)259,
187(1)81,
187(1)87,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
190(1)61,
191(1)1,
192(2)315,
194(1)123,
194(1)225,
194(1)241,
194(1)242-1,
194(1)z,
195(1)3,
196(1)109,
196(1)153,
196(1)319,
197(1)157,
197(1)171,
199(1)145,
209(1)331,
209(1)389
- decidability,
138(1)3,
139(1)1,
139(1)27,
141(1)253,
145(1)111,
146(1)243,
147(1)149,
147(1)165,
148(2)227,
148(2)281,
150(1)1,
154(1)23,
154(1)107,
155(2)321,
155(2)447,
156(1)119,
157(1)115,
158(1)161,
160(1)145,
160(1)185,
161(1)93,
161(1)141,
161(1)191,
164(1)29,
164(1)123,
164(1)141,
164(1)223,
165(2)247,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
168(2)241,
168(2)z,
170(1)1,
170(1)445,
172(1)67,
172(1)309,
174(1)217,
174(1)269,
175(1)15,
175(1)127,
175(1)z,
176(1)67,
176(1)111,
176(1)175,
176(1)235,
179(1)301,
180(1)61,
180(1)203,
183(1)83,
183(2)215,
186(1)231,
193(1)149,
193(1)181,
193(1)197,
194(1)87,
194(1)219,
195(1)33,
195(2)113,
197(1)245,
198(1)1,
215(1)169,
216(1)363
- enumerable,
147(1)149,
161(1)235,
168(2)321,
205(1)61,
205(1)195
- hyperbolic,
193(1)53
- recursively,
147(1)149,
160(1)241,
161(1)235,
161(1)263,
168(2)321,
205(1)61,
205(1)195
- subset,
138(1)35,
138(1)67,
138(1)141,
151(1)29,
154(2)379,
163(1)1,
163(1)55,
166(1)49,
168(1)155,
169(2)123,
179(1)427,
180(1)363,
187(1)167,
192(2)259,
193(1)1,
193(1)113,
207(1)171,
219(1)19,
219(1)65,
224(1)135
- Turing,
138(1)67,
143(1)123,
143(1)159,
145(1)111,
148(1)33,
148(2)325,
158(1)193,
161(1)301,
162(1)45,
168(2)215,
168(2)241,
168(2)257,
168(2)267,
168(2)303,
168(2)321,
168(2)417,
168(2)461,
168(2)z,
172(1)135,
174(1)203,
174(1)217,
180(1)139,
180(1)229,
180(1)341,
181(1)119,
182(1)159,
191(1)215,
192(2)315,
194(1)137,
210(1)217,
217(1)3,
411(31)2999
- two,
141(1)195,
149(1)179,
154(2)165,
155(1)265,
162(2)323,
164(1)73,
168(1)39,
177(2)487,
180(1)371,
182(1)217,
183(2)187,
197(1)244-1,
210(1)217,
224(1)73
- Zhong, Ning,
219(1)487