Results 271 to 280 of about 380,262 (318)
Some of the next articles are maybe not open access.
IEEE Computer Graphics and Applications, 2006
When it comes to creative technique, cover artist Rick Spix will sometimes have a plan in mind while other times implement a more improvised trial-and-error approach. Spix says that the Ultrafractal program lets him simply create art the way he wants to.
openaire +2 more sources
When it comes to creative technique, cover artist Rick Spix will sometimes have a plan in mind while other times implement a more improvised trial-and-error approach. Spix says that the Ultrafractal program lets him simply create art the way he wants to.
openaire +2 more sources
Synthese, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Applied Categorical Structures, 2009
The paper analyses the relation between various finiteness classes in ZF set theory without Choice. It starts with an an extensive background collecting citations of the most influential mathematicians and philosophers (Weyl, Hilbert, Russell, Pascal, Galileo, Leibniz, Bolzano, Dedekind, von Neumann) on the nature of infinity.
openaire +2 more sources
The paper analyses the relation between various finiteness classes in ZF set theory without Choice. It starts with an an extensive background collecting citations of the most influential mathematicians and philosophers (Weyl, Hilbert, Russell, Pascal, Galileo, Leibniz, Bolzano, Dedekind, von Neumann) on the nature of infinity.
openaire +2 more sources
Infinite Diversity in Infinite Combinations
Psychological Inquiry, 1992The basic argument of Fox's article is that prejudice is an inevitable consequence of natural selection. The article is interesting to read, covers a tremendous amount of territory in sociobiology, social cognition, and Star Trek lore, and raises some of the fundamental issues at the core of intergroup perceptions. Unfortunately, this effort has fallen
Craig Johnson, Brian Mullen
openaire +1 more source
Foundations of Science, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2005
AbstractThis book describes the historical emergence and spread of the to-infinitive in English. It shows that to + infinitive emerged from a reanalysis of the preposition to plus a deverbal nominalization, which spread first to purpose clauses, then to other non-finite environments.
openaire +3 more sources
AbstractThis book describes the historical emergence and spread of the to-infinitive in English. It shows that to + infinitive emerged from a reanalysis of the preposition to plus a deverbal nominalization, which spread first to purpose clauses, then to other non-finite environments.
openaire +3 more sources
Mind, 2007
Consider the following process of epistemic justification: proposition E-0 is made probable by El, which in turn is made probable by E-2, which is made probable by E-3, and so on. Can this process go on indefinitely? Foundationalists, coherentists, and sceptics claim that it cannot.
openaire +1 more source
Consider the following process of epistemic justification: proposition E-0 is made probable by El, which in turn is made probable by E-2, which is made probable by E-3, and so on. Can this process go on indefinitely? Foundationalists, coherentists, and sceptics claim that it cannot.
openaire +1 more source
Scientific American, 2012
The article discusses mathematician Kurt Godel's "P versus NP" question as an organizing principle of computer science and the implications of a machine's ability to answer yes-or-no questions. Topics include how computational complexity theory studies computers' capabilities, how mathematician Michael Sipser placed a bet on the P versus NP problem ...
openaire +2 more sources
The article discusses mathematician Kurt Godel's "P versus NP" question as an organizing principle of computer science and the implications of a machine's ability to answer yes-or-no questions. Topics include how computational complexity theory studies computers' capabilities, how mathematician Michael Sipser placed a bet on the P versus NP problem ...
openaire +2 more sources
An Infinite Family of Linear Codes Supporting 4-Designs
IEEE Transactions on Information Theory, 2021Chunming Tang, Cunsheng Ding
exaly
A unifying modeling abstraction for infinite-dimensional optimization
Computers and Chemical Engineering, 2022Joshua L Pulsipher +2 more
exaly