SpiceQA
Questions
Tags
Users
Badges
computer-science
227 Questions
Newest
Active
Unanswered
Frequent
More
Score
View
Card
Compact
What are practical guidelines for evaluating a language's "Turing Completeness"?
AShelly_10396
0
•
asked Jan 15, 2009
49
13
12139
computer-science
turing-complete
language-design
Is there a difference between foreach and map?
Robert_Gould_15124
0
•
asked Dec 10, 2008
237
9
79243
map-function
computer-science
language-agnostic
foreach
Are duplicate keys allowed in the definition of binary search trees?
Tim_Merrifield_36706
0
•
asked Nov 19, 2008
196
12
137328
binary-tree
computer-science
data-structures
What does the quote "An extra level of indirection solves every problem" mean?
Vicky_26927
0
•
asked Nov 13, 2008
46
7
19345
indirection
abstraction
computer-science
What is Type-safe?
Admin
1
•
asked Nov 4, 2008
331
12
136647
computer-science
language-agnostic
programming-languages
type-safety
terminology
What's a Turing machine?
user_15055
0
•
asked Oct 25, 2008
47
11
27262
computer-science
computability
turing-machines
theory
What is referential transparency?
user_15055
0
•
asked Oct 17, 2008
321
15
61736
referential-transparency
computer-science
theory
functional-programming
Function pointers, Closures, and Lambda
Mark_Lubin_25012
0
•
asked Oct 16, 2008
88
12
37219
computer-science
lisp
closures
lambda
c
What is code coverage and how do YOU measure it?
Brian_G_3208
0
•
asked Oct 12, 2008
344
11
241177
computer-science
code-coverage
testing
Way to go from recursion to iteration
Gustavo_Carreno_8167
0
•
asked Oct 1, 2008
432
21
178392
computer-science
theory
recursion
language-agnostic
iteration
Prev
Prev
19
20
21
22
(current)
23
Next
Next
Hot Questions