2014 First International Conference on Networks &Amp; Soft Computing (ICNSC2014) 2014
DOI: 10.1109/cnsc.2014.6906670
|View full text |Cite
|
Sign up to set email alerts
|

Computational models of time perception

Abstract: It is known that a parallel computer can solve problems that are impossible to be solved sequentially. That is, any general purpose sequential model of computation, such as the Turing machine or the random access machine (RAM), cannot simulate certain computations, for example solutions to real-time problems, that are carried out by a specific parallel computer. This paper extends the scope of such problems to the class of problems with uncertain time constraints. The first type of time constraints refers to u… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…Since we consider emergent models of time perception in this review, we accepted the definition of McClelland et al (2010) to include neurocomputational models of time perception. For cognitive models of time perception, you may refer to Anamalamudi, Surampudi, and Maganti (2014) and Komosinski and Kups (2015).…”
Section: Computational and Robotic Models Of Time Perceptionmentioning
confidence: 99%
“…Since we consider emergent models of time perception in this review, we accepted the definition of McClelland et al (2010) to include neurocomputational models of time perception. For cognitive models of time perception, you may refer to Anamalamudi, Surampudi, and Maganti (2014) and Komosinski and Kups (2015).…”
Section: Computational and Robotic Models Of Time Perceptionmentioning
confidence: 99%
“…Although there are numerous ways in which computational models of interval timing can be classified, we have chosen to group these models into four major, although sometimes overlapping, classes: firstly, pacemaker-accumulator models (PA models), secondly, multiple-oscillator-coincidence detection models (also sometimes called timestamp models), thirdly, memory or neural process models and, finally, fourthly random-process (or drift-diffusion) models. For alternative classification schemes, see, for example [1,2 ].In what follows we will suggest that computational models of interval timing be judged on the basis of the following criteria: the scalar property, prospective and retrospective timing, and the effects of attention and neuropharmacological manipulations.Extensive empirical evidence [3][4][5][6] suggests that timeestimation errors in interval timing grow approximately linearly with the size of the estimate. Known as the scalar property of time estimation, this fact sets a hard constraint on the nature of the underlying processes involved in time estimation [7].…”
mentioning
confidence: 99%
“…Although there are numerous ways in which computational models of interval timing can be classified, we have chosen to group these models into four major, although sometimes overlapping, classes: firstly, pacemaker-accumulator models (PA models), secondly, multiple-oscillator-coincidence detection models (also sometimes called timestamp models), thirdly, memory or neural process models and, finally, fourthly random-process (or drift-diffusion) models. For alternative classification schemes, see, for example [1,2 ].…”
mentioning
confidence: 99%