Results 191 to 200 of about 4,476 (227)
Some of the next articles are maybe not open access.
Nursing Standard, 1991
I am writing to dispel the apparent nursing myth that it is a foregone conclusion that SENs automatically pass their conversion courses.
openaire +2 more sources
I am writing to dispel the apparent nursing myth that it is a foregone conclusion that SENs automatically pass their conversion courses.
openaire +2 more sources
Synthese, 2015
It is not rare in philosophy and psychology to see theorists fall into dichotomous thinking about mental phenomena. On one side of the dichotomy there are processes that I will label “unintelligent.” These processes are thought to be unconscious, implicit, automatic, unintentional, involuntary, procedural, and non-cognitive.
openaire +2 more sources
It is not rare in philosophy and psychology to see theorists fall into dichotomous thinking about mental phenomena. On one side of the dichotomy there are processes that I will label “unintelligent.” These processes are thought to be unconscious, implicit, automatic, unintentional, involuntary, procedural, and non-cognitive.
openaire +2 more sources
The American Journal of Forensic Medicine and Pathology, 1984
The historic development and validity of drug automatism are discussed. Original articles and other publications supporting the concept do not present authenticated cases to validate the concept; therefore, it remains unproved.
openaire +2 more sources
The historic development and validity of drug automatism are discussed. Original articles and other publications supporting the concept do not present authenticated cases to validate the concept; therefore, it remains unproved.
openaire +2 more sources
The automaticity of interpreting Automaticity.
American Psychologist, 2000A F, Smith, B D, Slife
openaire +2 more sources
2009
We give an overview of applications of weighted finite automata to automatically prove termination of rewriting. Instances of this approach are: standard and arctic matrix interpretations, and the match bound technique. These methods have been developed in recent years, and they are being used by today's leading automated termination prover software.
openaire +1 more source
We give an overview of applications of weighted finite automata to automatically prove termination of rewriting. Instances of this approach are: standard and arctic matrix interpretations, and the match bound technique. These methods have been developed in recent years, and they are being used by today's leading automated termination prover software.
openaire +1 more source
Spitting Automatism in Complex Partial Seizures: A Nondominant Temporal Localizing Sign?
Epilepsia, 1999Keith G Davies +2 more
exaly