277 results on '"Martin, Barnaby"'
Search Results
252. Correctness, Explanation and Intention
253. Effective Embeddings for Pairs of Structures
254. Higher Type Recursion for Transfinite Machine Theory
255. Uniform Relativization
256. Non-Recursive Trade-Offs Are 'Almost Everywhere'
257. On the Differences and Sums of Strongly Computably Enumerable Real Numbers
258. The d.r.e wtt-Degrees are Dense
259. Nets and Reverse Mathematics : Some Initial Results
260. Destroying Bicolored s by Deleting Few Edges
261. Kalmár’s Argument for the Independence of Computer Science
262. Surreal Blum-Shub-Smale Machines
263. Recent Advances in the Computation of the Homology of Semialgebraic Sets
264. An algorithmic approach to characterizations of admissibles
265. Representations of Natural Numbers and Computability of Various Functions
266. On Approximate Uncomputability of the Kolmogorov Complexity Function
267. More Intensional Versions of Rice’s Theorem
268. Degree Spectra for Transcendence in Fields
269. Cohesive Powers of Linear Orders
270. Borel and Baire Sets in Bishop Spaces
271. Study of Stepwise Simulation Between ASM
272. A Note on the Ordinal Analysis of
273. Complexity of Maximum Fixed Point Problem in Boolean Networks
274. Towards Uniform Online Spherical Tessellations
275. Complexity of Conjunctive Regular Path Query Homomorphisms
276. Towards Uniform Online Spherical Tessellations
277. Higher Type Recursion for Transfinite Machine Theory
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.