Search

Your search keyword '"Ferreira, Fernando"' showing total 68 results

Search Constraints

Start Over You searched for: Author "Ferreira, Fernando" Remove constraint Author: "Ferreira, Fernando" Publisher springer berlin heidelberg Remove constraint Publisher: springer berlin heidelberg
68 results on '"Ferreira, Fernando"'

Search Results

6. Humans in the Enterprise Interoperability Ecosystem

11. A Short Note on Spector’s Proof of Consistency of Analysis

13. Torque Control of Switched Reluctance Motors Based on Flexible Neural Network

17. A Faster Algorithm for Finding Minimum Tucker Submatrices

18. Ergodic-Type Characterizations of Algorithmic Randomness

19. Processes in Space

20. How Powerful Are Integer-Valued Martingales?

21. Every -Set Is Natural, Up to Turing Equivalence

22. Quasi-linear Dialectica Extraction

23. Proofs, Programs, Processes

24. Inference Concerning Physical Systems

25. Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole

26. The Ordinal of Skolem + Tetration Is τ 0

27. Kolmogorov Complexity Cores

28. Hairpin Lengthening

29. What Is the Problem with Proof Nets for Classical Logic?

30. Computable Fields and Weak Truth-Table Reducibility

31. Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo

32. The Complexity of Explicit Constructions

33. On the Completeness of Quantum Computation Models

34. The Strength of the Besicovitch-Davies Theorem

35. Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program

36. Computational Complexity Aspects in Membrane Computing

37. Computable Ordered Abelian Groups and Fields

38. Three Roots for Leibniz’s Contribution to the Computational Conception of Reason

39. Focusing in Asynchronous Games

40. A Note on the Least Informative Model of a Theory

41. Approximate Self-assembly of the Sierpinski Triangle

42. Circuit Complexity and Multiplicative Complexity of Boolean Functions

43. Incomputability in Physics

44. Higher-Order Containers

45. Degrees with Almost Universal Cupping Property

46. Definability in the Subword Order

47. On Index Sets of Some Properties of Computable Algebras

48. Undecidability in Weihrauch Degrees

49. Is Not a Heyting Algebra

50. Lower Bounds for Reducibility to the Kolmogorov Random Strings

Catalog

Books, media, physical & digital resources