Entry Zeugmann:1988:PRO from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
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{Zeugmann:1988:PRO,
author = "Thomas Zeugmann",
title = "On the Power of Recursive Optimizers",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "289--310",
month = dec,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
ftp://ftp.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Humboldt Univ Berlin",
affiliationaddress = "Berlin, East Ger",
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Math., Humboldt Univ., Berlin, East Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "arbitrary program; Computer Metatheory; Computer
Programming--Theory; Existence Problem; fastest
programs; Inductive Inference; power; Program
Synthesis; Programming Theory; recursive functions;
recursive optimizers; Recursive Optimizers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- arbitrary,
36(1)1,
37(3)269,
38(1)55,
42(1)1,
45(1)87,
45(2)193,
49(2)239,
52(3)177,
55(1)87,
57(2)283,
59(1)133,
59(3)211,
61(1)83,
64(1)15,
67(2)203
- existence,
35(2)165,
37(3)269,
69(3)319
- inductive,
43(1)81,
46(2)175,
54(1)3,
55(1)87,
59(1)133
- inference,
35(2)129,
38(1)99,
41(2)271,
54(1)103,
62(1)39,
66(3)255,
67(1)5,
67(2)173
- Metatheory,
57(0)3,
58(0)3,
58(1)129,
58(1)209,
59(0)3,
59(1)25,
59(1)85,
59(1)115,
59(1)181,
59(3)211,
59(3)235,
59(3)287,
59(3)317,
60(3)231,
60(3)255,
60(3)297,
61(2)103,
61(2)199,
62(3)311,
62(3)319,
63(1)1,
63(1)19,
63(1)43,
63(1)91,
63(2)113,
63(2)203,
63(3)239,
63(3)253,
63(3)275,
63(3)303,
63(3)333,
64(1)1,
64(1)15,
64(1)25,
64(1)55,
64(1)67,
64(1)97,
64(1)119,
64(3)221,
64(3)271,
64(3)281,
64(3)305,
64(3)331,
64(3)343,
65(0)123,
65(1)1,
65(1)35,
65(1)85,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
65(2)265,
65(3)271,
65(3)291,
65(3)343,
66(0)117,
66(2)205,
67(1)19,
67(1)87
- power,
36(1)1,
36(1)127,
39(2)267,
40(1)13,
41(1)51,
41(1)109,
44(1)1,
44(1)111,
46(2)285,
47(1)15,
50(3)285,
53(2)187,
54(2)331,
56(1)135,
57(1)147,
57(2)225,
60(1)83,
62(3)319,
65(1)35,
65(2)131,
67(2)143,
69(1)1
- Programming--Theory,
59(0)3,
59(1)25,
62(3)319,
63(1)19,
63(2)113,
63(3)253,
63(3)303,
64(3)271,
64(3)305,
64(3)331
- recursive,
35(2)227,
35(2)261,
36(1)1,
37(1)77,
38(1)17,
38(1)35,
39(1)15,
39(2)207,
40(2)323,
41(1)33,
41(2)289,
42(1)1,
42(2)123,
42(3)251,
44(3)307,
45(1)1,
45(2)193,
46(2)239,
47(2)121,
47(2)131,
47(3)299,
51(1)129,
52(3)281,
53(1)25,
53(1)z,
54(1)29,
57(2)327,
60(1)83,
60(3)297,
61(2)103,
62(0)3,
62(1)187,
63(1)43,
63(3)253,
66(3)255,
66(3)289,
66(3)333,
68(3)303,
69(1)1
- synthesis,
39(2)135,
46(2)175,
58(1)183,
59(1)115,
61(2)225
- Theory, Programming-,
59(0)3,
59(1)25,
62(3)319,
63(1)19,
63(2)113,
63(3)253,
63(3)303,
64(3)271,
64(3)305,
64(3)331