429 search results - page 28 / 86 » Turing computations on ordinals |
101
click to vote
BIRTHDAY
2008
Springer
15 years 27 days ago
2008
Springer
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
107
click to vote
SMILE
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. Since uncalibrated images permit only projective reconstruction, metric information requires either camera or scene calibration. We propose a stratified approach to proje...
WSPI
2008
15 years 1 months ago
2008
Computers today are not only the calculation tools - they are directly (inter)acting in the physical world which itself may be conceived of as the universal computer (Zuse, Fredkin...
136
click to vote
LOGCOM
2010
14 years 6 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
JAIR
2008
14 years 11 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...