-
Notifications
You must be signed in to change notification settings - Fork 1
/
literatura.bib
executable file
·218 lines (195 loc) · 5.83 KB
/
literatura.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
@online{url:recursionAlgol,
author = "Maarten van Emden",
title = "How recursion got into programming: a tale of intrigue, betrayal, {and} advanced programming-language semantics",
year = 2014,
url = "https://vanemden.wordpress.com/2014/06/18/how-recursion-got-into-programming-a-comedy-of-errors-3/"
}
@online{url:tao,
author={Terence Tao},
title={The ``no self-defeating object'' argument},
year=2009,
url="https://terrytao.wordpress.com/2009/11/05/the-no-self-defeating-object-argument/"
}
@inproceedings{art:memorymodels,
title={Explaining relaxed memory models with program transformations},
author={Lahav, Ori and Vafeiadis, Viktor},
booktitle={International Symposium on Formal Methods},
pages={479--495},
year={2016},
organization={Springer},
url= "http://plv.mpi-sws.org/trns/paper.pdf"
}
@online{url:wrongBinsearch,
author = "Joshua Bloch",
title = "Extra, Extra -- Read All About It: Nearly All Binary Searches {and} Mergesorts are Broken",
year = 2006,
url = "https://research.googleblog.com/2006/06/extra-extra-read-all-about-it-nearly.html"
}
@online{url:movecopy,
title = "Why is the copying instruction usually named MOV?",
year = 2013,
url = "https://softwareengineering.stackexchange.com/questions/222254/why-is-the-copying-instruction-usually-named-mov",
author = "Netch"
}
@book{skr:Vuk,
author = "Mladen Vuković",
title = "Izračunljivost --- predavanja",
year = 2015,
label = "VukIzr"
}
@book{skr:VukML,
author = "Mladen Vuković",
title = "Matematička logika",
publisher = "Element",
isbn = "978-953-197-519-3",
year = "2009",
label = "VukML"
}
@book{skr:VukTS,
author = "Mladen Vuković",
title = "Teorija skupova --- predavanja",
month = jan,
year = 2015,
label = "VukTS"
}
@unpublished{note:EWD831,
author = "Edsger Wybe Dijkstra",
title = "Why numbering should start at zero",
month = aug,
year = "1982",
url = "http://www.cs.utexas.edu/users/EWD/ewd08xx/EWD831.PDF",
label = "EWD"
}
@online{url:calc,
url = "https://blogs.msdn.microsoft.com/oldnewthing/20160628-00/?p=93765",
author = "Raymond Chen",
title = "Why does the Windows calculator generate tiny errors when calculating the square root of a perfect square?",
year = "2016",
month = jun,
label = "Chen"
}
@article{turing,
title="On computable numbers, with an application to the Entscheidungsproblem",
author="Alan Mathison Turing",
journal="Proceedings of the London mathematical society",
volume="2",
number="1",
pages="230--265",
year="1937",
publisher="Wiley Online Library"
}
@book{sipser,
added-at = {2014-03-03T20:31:26.000+0100},
address = {Boston, MA},
author = {Sipser, Michael},
biburl = {https://www.bibsonomy.org/bibtex/2a275d239d3a005a2a0825e49ce8dced5/ytyoun},
edition = {3},
interhash = {ba5fd05e9f15a677c2c9e619c57de9a7},
intrahash = {a275d239d3a005a2a0825e49ce8dced5},
isbn = {113318779X},
keywords = {automata complexity computation hamiltonian np-hardness sipser textbook},
publisher = {Course Technology},
refid = {814441519},
timestamp = {2016-12-04T08:23:19.000+0100},
title = {Introduction to the Theory of Computation},
year = 2013
}
@thesis{lovnicki,
author = {Lovnički, Sandro},
title = {Interpreter za $\lambda$-račun},
type = {Diplomski rad},
institution = {Sveučilište u Zagrebu, Prirodoslovno-matematički fakultet},
year = 2018,
month = sep
}
@thesis{posav,
author = {Posavčević, Ivan},
title = {Izračunljivost na skupovima $\mathbb Z$, $\mathbb Q$, $\mathbb R$ i $\mathbb C$},
type = {Diplomski rad},
institution = {Sveučilište u Zagrebu, Prirodoslovno-matematički fakultet},
year = 2016,
month = sep,
url = {http://digre.pmf.unizg.hr/5277/1/diplomski.pdf}
}
@article{soare,
url={http://www.people.cs.uchicago.edu/~soare/History/handbook.pdf},
title={Computability and Recursion},
volume={2},
DOI={10.2307/420992},
number={3},
journal={Bulletin of Symbolic Logic},
publisher={Cambridge University Press},
author={Soare, Robert Irving},
year={1996},
pages={284–321}
}
@book{smullyan,
title={Godel's Incompleteness Theorems},
author={Smullyan, Raymond Merrill},
isbn={9780195364378},
series={Oxford Logic Guides},
year=1992,
publisher={Oxford University Press}
}
@techreport{huggins,
author = {Huggins, James and Wallace, Charles},
year = {2003},
month = apr,
title = {An Abstract State Machine Primer}
}
@book{shoenfield,
title={Recursion theory},
author={Shoenfield, Joseph Robert},
isbn={9783540570936},
lccn={lc93034447},
series={Lecture notes in logic},
year={1993},
publisher={Springer\hyphen Verlag}
}
@online{mazur,
title = "The make-believe world of real-world physics",
author = "Eric Mazur",
year = {2008},
month = jul,
url = "https://youtu.be/8dU_WNf8Wg0"
}
@online{dershowitz,
title = "A Proof of the Church-Turing Thesis",
author = "Udi Boker and Nachum Dershowitz",
year = {2005},
month = jan,
url = "http://www.cs.tau.ac.il/~nachumd/papers/Church-Turing-Theorem.pdf"
}
@article{post,
title={Recursively enumerable sets of positive integers and their decision problems},
author={Post, Emil Leon},
journal={Bulletin of the American Mathematical Society},
volume={50},
number={5},
pages={284--316},
year={1944},
url="https://goo.gl/nJSynP",
label={Post}
}
@online{magicTuring,
title="Magic: The Gathering is Turing Complete",
author = "Alex Churchill and Stella Biderman and Austin Herrick",
year="2019",
month = apr,
url = "https://arxiv.org/pdf/1904.09828.pdf"
}
@online{Ackermann,
title="Calculus of Inductive Constructions",
author="Vedran Čačić",
part=3,
year=2020,
month=may,
url="https://meduza.carnet.hr/index.php/media/watch/17301"
}
@misc{sedgewick,
title={Algorithms},
edition={4},
author={Sedgewick, Robert and Wayne, Kevin},
year={2011},
publisher={Addison-Wesley}
}